49.49/40.15 NO 49.49/40.15 49.49/40.15 Ultimate: Cannot open display: 49.49/40.15 This is Ultimate 0.1.24-8dc7c08-m 49.49/40.15 [2019-03-28 12:06:02,078 INFO L170 SettingsManager]: Resetting all preferences to default values... 49.49/40.15 [2019-03-28 12:06:02,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 49.49/40.15 [2019-03-28 12:06:02,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 49.49/40.15 [2019-03-28 12:06:02,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 49.49/40.15 [2019-03-28 12:06:02,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 49.49/40.15 [2019-03-28 12:06:02,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 49.49/40.15 [2019-03-28 12:06:02,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 49.49/40.15 [2019-03-28 12:06:02,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 49.49/40.15 [2019-03-28 12:06:02,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 49.49/40.15 [2019-03-28 12:06:02,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 49.49/40.15 [2019-03-28 12:06:02,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 49.49/40.15 [2019-03-28 12:06:02,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 49.49/40.15 [2019-03-28 12:06:02,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 49.49/40.15 [2019-03-28 12:06:02,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 49.49/40.15 [2019-03-28 12:06:02,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 49.49/40.15 [2019-03-28 12:06:02,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 49.49/40.15 [2019-03-28 12:06:02,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 49.49/40.15 [2019-03-28 12:06:02,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 49.49/40.15 [2019-03-28 12:06:02,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 49.49/40.15 [2019-03-28 12:06:02,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,113 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 49.49/40.15 [2019-03-28 12:06:02,114 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 49.49/40.15 [2019-03-28 12:06:02,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 49.49/40.15 [2019-03-28 12:06:02,115 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 49.49/40.15 [2019-03-28 12:06:02,116 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 49.49/40.15 [2019-03-28 12:06:02,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 49.49/40.15 [2019-03-28 12:06:02,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 49.49/40.15 [2019-03-28 12:06:02,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 49.49/40.15 [2019-03-28 12:06:02,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 49.49/40.15 [2019-03-28 12:06:02,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 49.49/40.15 [2019-03-28 12:06:02,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 49.49/40.15 [2019-03-28 12:06:02,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 49.49/40.15 [2019-03-28 12:06:02,122 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 49.49/40.15 [2019-03-28 12:06:02,137 INFO L110 SettingsManager]: Loading preferences was successful 49.49/40.15 [2019-03-28 12:06:02,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 49.49/40.15 [2019-03-28 12:06:02,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 49.49/40.15 [2019-03-28 12:06:02,138 INFO L133 SettingsManager]: * Rewrite not-equals=true 49.49/40.15 [2019-03-28 12:06:02,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 49.49/40.15 [2019-03-28 12:06:02,138 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 49.49/40.15 [2019-03-28 12:06:02,139 INFO L133 SettingsManager]: * Use SBE=true 49.49/40.15 [2019-03-28 12:06:02,139 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 49.49/40.15 [2019-03-28 12:06:02,139 INFO L133 SettingsManager]: * Use old map elimination=false 49.49/40.15 [2019-03-28 12:06:02,139 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 49.49/40.15 [2019-03-28 12:06:02,139 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 49.49/40.15 [2019-03-28 12:06:02,139 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 49.49/40.15 [2019-03-28 12:06:02,140 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 49.49/40.15 [2019-03-28 12:06:02,140 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 49.49/40.15 [2019-03-28 12:06:02,140 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:02,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 49.49/40.15 [2019-03-28 12:06:02,140 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 49.49/40.15 [2019-03-28 12:06:02,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE 49.49/40.15 [2019-03-28 12:06:02,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 49.49/40.15 [2019-03-28 12:06:02,141 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 49.49/40.15 [2019-03-28 12:06:02,141 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 49.49/40.15 [2019-03-28 12:06:02,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 49.49/40.15 [2019-03-28 12:06:02,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 49.49/40.15 [2019-03-28 12:06:02,141 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 49.49/40.15 [2019-03-28 12:06:02,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 49.49/40.15 [2019-03-28 12:06:02,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 49.49/40.15 [2019-03-28 12:06:02,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 49.49/40.15 [2019-03-28 12:06:02,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 49.49/40.15 [2019-03-28 12:06:02,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 49.49/40.15 [2019-03-28 12:06:02,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 49.49/40.15 [2019-03-28 12:06:02,182 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 49.49/40.15 [2019-03-28 12:06:02,186 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 49.49/40.15 [2019-03-28 12:06:02,187 INFO L271 PluginConnector]: Initializing CDTParser... 49.49/40.15 [2019-03-28 12:06:02,188 INFO L276 PluginConnector]: CDTParser initialized 49.49/40.15 [2019-03-28 12:06:02,188 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 49.49/40.15 [2019-03-28 12:06:02,255 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ec98ce82c0d0498dae9fdf1f6ce5ef3e/FLAG8237724cb 49.49/40.15 [2019-03-28 12:06:02,604 INFO L307 CDTParser]: Found 1 translation units. 49.49/40.15 [2019-03-28 12:06:02,605 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 49.49/40.15 [2019-03-28 12:06:02,612 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ec98ce82c0d0498dae9fdf1f6ce5ef3e/FLAG8237724cb 49.49/40.15 [2019-03-28 12:06:04,170 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ec98ce82c0d0498dae9fdf1f6ce5ef3e 49.49/40.15 [2019-03-28 12:06:04,181 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 49.49/40.15 [2019-03-28 12:06:04,183 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 49.49/40.15 [2019-03-28 12:06:04,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 49.49/40.15 [2019-03-28 12:06:04,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 49.49/40.15 [2019-03-28 12:06:04,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 49.49/40.15 [2019-03-28 12:06:04,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784aef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 49.49/40.15 [2019-03-28 12:06:04,217 INFO L176 MainTranslator]: Built tables and reachable declarations 49.49/40.15 [2019-03-28 12:06:04,373 INFO L206 PostProcessor]: Analyzing one entry point: main 49.49/40.15 [2019-03-28 12:06:04,378 INFO L191 MainTranslator]: Completed pre-run 49.49/40.15 [2019-03-28 12:06:04,393 INFO L206 PostProcessor]: Analyzing one entry point: main 49.49/40.15 [2019-03-28 12:06:04,408 INFO L195 MainTranslator]: Completed translation 49.49/40.15 [2019-03-28 12:06:04,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04 WrapperNode 49.49/40.15 [2019-03-28 12:06:04,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 49.49/40.15 [2019-03-28 12:06:04,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 49.49/40.15 [2019-03-28 12:06:04,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 49.49/40.15 [2019-03-28 12:06:04,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 49.49/40.15 [2019-03-28 12:06:04,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 49.49/40.15 [2019-03-28 12:06:04,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 49.49/40.15 [2019-03-28 12:06:04,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 49.49/40.15 [2019-03-28 12:06:04,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized 49.49/40.15 [2019-03-28 12:06:04,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 49.49/40.15 [2019-03-28 12:06:04,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 49.49/40.15 [2019-03-28 12:06:04,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... 49.49/40.15 [2019-03-28 12:06:04,519 INFO L276 PluginConnector]: RCFGBuilder initialized 49.49/40.15 [2019-03-28 12:06:04,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (1/1) ... 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 49.49/40.15 [2019-03-28 12:06:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch 49.49/40.15 [2019-03-28 12:06:04,583 INFO L138 BoogieDeclarations]: Found implementation of procedure bsearch 49.49/40.15 [2019-03-28 12:06:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 49.49/40.15 [2019-03-28 12:06:04,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 49.49/40.15 [2019-03-28 12:06:04,728 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 49.49/40.15 [2019-03-28 12:06:04,728 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 49.49/40.15 [2019-03-28 12:06:04,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:04 BoogieIcfgContainer 49.49/40.15 [2019-03-28 12:06:04,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 49.49/40.15 [2019-03-28 12:06:04,730 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 49.49/40.15 [2019-03-28 12:06:04,731 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 49.49/40.15 [2019-03-28 12:06:04,733 INFO L276 PluginConnector]: BlockEncodingV2 initialized 49.49/40.15 [2019-03-28 12:06:04,733 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:04" (1/1) ... 49.49/40.15 [2019-03-28 12:06:04,750 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 18 edges 49.49/40.15 [2019-03-28 12:06:04,751 INFO L258 BlockEncoder]: Using Remove infeasible edges 49.49/40.15 [2019-03-28 12:06:04,752 INFO L263 BlockEncoder]: Using Maximize final states 49.49/40.15 [2019-03-28 12:06:04,753 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 49.49/40.15 [2019-03-28 12:06:04,753 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 49.49/40.15 [2019-03-28 12:06:04,755 INFO L296 BlockEncoder]: Using Remove sink states 49.49/40.15 [2019-03-28 12:06:04,756 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 49.49/40.15 [2019-03-28 12:06:04,756 INFO L179 BlockEncoder]: Using Rewrite not-equals 49.49/40.15 [2019-03-28 12:06:04,774 INFO L185 BlockEncoder]: Using Use SBE 49.49/40.15 [2019-03-28 12:06:04,790 INFO L200 BlockEncoder]: SBE split 2 edges 49.49/40.15 [2019-03-28 12:06:04,795 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 49.49/40.15 [2019-03-28 12:06:04,796 INFO L71 MaximizeFinalStates]: 0 new accepting states 49.49/40.15 [2019-03-28 12:06:04,805 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 49.49/40.15 [2019-03-28 12:06:04,808 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 49.49/40.15 [2019-03-28 12:06:04,809 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 49.49/40.15 [2019-03-28 12:06:04,809 INFO L71 MaximizeFinalStates]: 0 new accepting states 49.49/40.15 [2019-03-28 12:06:04,810 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 49.49/40.15 [2019-03-28 12:06:04,810 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 49.49/40.15 [2019-03-28 12:06:04,811 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges 49.49/40.15 [2019-03-28 12:06:04,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:04 BasicIcfg 49.49/40.15 [2019-03-28 12:06:04,811 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 49.49/40.15 [2019-03-28 12:06:04,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 49.49/40.15 [2019-03-28 12:06:04,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... 49.49/40.15 [2019-03-28 12:06:04,816 INFO L276 PluginConnector]: TraceAbstraction initialized 49.49/40.15 [2019-03-28 12:06:04,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:06:04" (1/4) ... 49.49/40.15 [2019-03-28 12:06:04,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ec35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (2/4) ... 49.49/40.15 [2019-03-28 12:06:04,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ec35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:04" (3/4) ... 49.49/40.15 [2019-03-28 12:06:04,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753ec35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:04" (4/4) ... 49.49/40.15 [2019-03-28 12:06:04,820 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 49.49/40.15 [2019-03-28 12:06:04,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 49.49/40.15 [2019-03-28 12:06:04,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 49.49/40.15 [2019-03-28 12:06:04,856 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 49.49/40.15 [2019-03-28 12:06:04,884 INFO L133 ementStrategyFactory]: Using default assertion order modulation 49.49/40.15 [2019-03-28 12:06:04,885 INFO L382 AbstractCegarLoop]: Interprodecural is true 49.49/40.15 [2019-03-28 12:06:04,885 INFO L383 AbstractCegarLoop]: Hoare is true 49.49/40.15 [2019-03-28 12:06:04,885 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 49.49/40.15 [2019-03-28 12:06:04,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 49.49/40.15 [2019-03-28 12:06:04,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 49.49/40.15 [2019-03-28 12:06:04,886 INFO L387 AbstractCegarLoop]: Difference is false 49.49/40.15 [2019-03-28 12:06:04,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 49.49/40.15 [2019-03-28 12:06:04,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 49.49/40.15 [2019-03-28 12:06:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. 49.49/40.15 [2019-03-28 12:06:04,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 49.49/40.15 [2019-03-28 12:06:04,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. 49.49/40.15 [2019-03-28 12:06:04,972 INFO L448 ceAbstractionStarter]: For program point bsearchEXIT(lines 8 15) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,972 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true 49.49/40.15 [2019-03-28 12:06:04,973 INFO L451 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: true 49.49/40.15 [2019-03-28 12:06:04,973 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,973 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,973 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,973 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,973 INFO L451 ceAbstractionStarter]: At program point bsearchENTRY(lines 8 15) the Hoare annotation is: true 49.49/40.15 [2019-03-28 12:06:04,974 INFO L448 ceAbstractionStarter]: For program point bsearchFINAL(lines 8 15) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,974 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 49.49/40.15 [2019-03-28 12:06:04,974 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true 49.49/40.15 [2019-03-28 12:06:04,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:04 BasicIcfg 49.49/40.15 [2019-03-28 12:06:04,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 49.49/40.15 [2019-03-28 12:06:04,978 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 49.49/40.15 [2019-03-28 12:06:04,978 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 49.49/40.15 [2019-03-28 12:06:04,982 INFO L276 PluginConnector]: BuchiAutomizer initialized 49.49/40.15 [2019-03-28 12:06:04,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.49/40.15 [2019-03-28 12:06:04,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:06:04" (1/5) ... 49.49/40.15 [2019-03-28 12:06:04,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156ec987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.49/40.15 [2019-03-28 12:06:04,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:04" (2/5) ... 49.49/40.15 [2019-03-28 12:06:04,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156ec987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.49/40.15 [2019-03-28 12:06:04,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:04" (3/5) ... 49.49/40.15 [2019-03-28 12:06:04,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156ec987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.49/40.15 [2019-03-28 12:06:04,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:04" (4/5) ... 49.49/40.15 [2019-03-28 12:06:04,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156ec987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:04, skipping insertion in model container 49.49/40.15 [2019-03-28 12:06:04,986 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.49/40.15 [2019-03-28 12:06:04,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:04" (5/5) ... 49.49/40.15 [2019-03-28 12:06:04,987 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 49.49/40.15 [2019-03-28 12:06:05,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation 49.49/40.15 [2019-03-28 12:06:05,016 INFO L374 BuchiCegarLoop]: Interprodecural is true 49.49/40.15 [2019-03-28 12:06:05,016 INFO L375 BuchiCegarLoop]: Hoare is true 49.49/40.15 [2019-03-28 12:06:05,016 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 49.49/40.15 [2019-03-28 12:06:05,016 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 49.49/40.15 [2019-03-28 12:06:05,016 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 49.49/40.15 [2019-03-28 12:06:05,016 INFO L379 BuchiCegarLoop]: Difference is false 49.49/40.15 [2019-03-28 12:06:05,017 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 49.49/40.15 [2019-03-28 12:06:05,017 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 49.49/40.15 [2019-03-28 12:06:05,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 49.49/40.15 [2019-03-28 12:06:05,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 49.49/40.15 [2019-03-28 12:06:05,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.49/40.15 [2019-03-28 12:06:05,044 INFO L119 BuchiIsEmpty]: Starting construction of run 49.49/40.15 [2019-03-28 12:06:05,052 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 49.49/40.15 [2019-03-28 12:06:05,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:05,052 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 49.49/40.15 [2019-03-28 12:06:05,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 49.49/40.15 [2019-03-28 12:06:05,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 49.49/40.15 [2019-03-28 12:06:05,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.49/40.15 [2019-03-28 12:06:05,054 INFO L119 BuchiIsEmpty]: Starting construction of run 49.49/40.15 [2019-03-28 12:06:05,054 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 49.49/40.15 [2019-03-28 12:06:05,054 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:05,060 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 6#L21true [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 10#bsearchENTRYtrue 49.49/40.15 [2019-03-28 12:06:05,060 INFO L796 eck$LassoCheckResult]: Loop: 10#bsearchENTRYtrue [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 9#L10true [48] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (> v_bsearch_~j_3 v_bsearch_~i_3) (= (mod .cse0 2) 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 3#L12true [28] L12-->L14: Formula: (= 0 |v_bsearch_#t~nondet0_4|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_4|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_3|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 11#L14true [38] L14-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~iInParam_2| (+ v_bsearch_~mid~0_5 1)) (= |v_bsearch_#in~jInParam_2| v_bsearch_~j_5)) InVars {bsearch_~j=v_bsearch_~j_5, bsearch_~mid~0=v_bsearch_~mid~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_2|, bsearch_#in~i=|v_bsearch_#in~iInParam_2|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 10#bsearchENTRYtrue 49.49/40.15 [2019-03-28 12:06:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2112, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:05,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:05,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2072822, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:05,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:05,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1951625653, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:05,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:05,326 INFO L216 LassoAnalysis]: Preferences: 49.49/40.15 [2019-03-28 12:06:05,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.49/40.15 [2019-03-28 12:06:05,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.49/40.15 [2019-03-28 12:06:05,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.49/40.15 [2019-03-28 12:06:05,327 INFO L127 ssoRankerPreferences]: Use exernal solver: true 49.49/40.15 [2019-03-28 12:06:05,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:05,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.49/40.15 [2019-03-28 12:06:05,328 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.49/40.15 [2019-03-28 12:06:05,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 49.49/40.15 [2019-03-28 12:06:05,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.49/40.15 [2019-03-28 12:06:05,329 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.49/40.15 [2019-03-28 12:06:05,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:05,533 INFO L300 LassoAnalysis]: Preprocessing complete. 49.49/40.15 [2019-03-28 12:06:05,534 INFO L412 LassoAnalysis]: Checking for nontermination... 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:05,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:05,542 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:05,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:05,588 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 [2019-03-28 12:06:06,050 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 49.49/40.15 [2019-03-28 12:06:06,053 INFO L216 LassoAnalysis]: Preferences: 49.49/40.15 [2019-03-28 12:06:06,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.49/40.15 [2019-03-28 12:06:06,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.49/40.15 [2019-03-28 12:06:06,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.49/40.15 [2019-03-28 12:06:06,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false 49.49/40.15 [2019-03-28 12:06:06,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:06,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.49/40.15 [2019-03-28 12:06:06,054 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.49/40.15 [2019-03-28 12:06:06,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 49.49/40.15 [2019-03-28 12:06:06,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.49/40.15 [2019-03-28 12:06:06,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.49/40.15 [2019-03-28 12:06:06,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:06,198 INFO L300 LassoAnalysis]: Preprocessing complete. 49.49/40.15 [2019-03-28 12:06:06,204 INFO L497 LassoAnalysis]: Using template 'affine'. 49.49/40.15 [2019-03-28 12:06:06,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.49/40.15 Termination analysis: LINEAR_WITH_GUESSES 49.49/40.15 Number of strict supporting invariants: 0 49.49/40.15 Number of non-strict supporting invariants: 1 49.49/40.15 Consider only non-deceasing supporting invariants: true 49.49/40.15 Simplify termination arguments: true 49.49/40.15 Simplify supporting invariants: trueOverapproximate stem: false 49.49/40.15 [2019-03-28 12:06:06,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.49/40.15 [2019-03-28 12:06:06,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.49/40.15 [2019-03-28 12:06:06,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.49/40.15 [2019-03-28 12:06:06,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.49/40.15 [2019-03-28 12:06:06,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.49/40.15 [2019-03-28 12:06:06,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.49/40.15 [2019-03-28 12:06:06,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.49/40.15 [2019-03-28 12:06:06,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 49.49/40.15 [2019-03-28 12:06:06,243 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 49.49/40.15 [2019-03-28 12:06:06,244 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 49.49/40.15 [2019-03-28 12:06:06,246 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 49.49/40.15 [2019-03-28 12:06:06,246 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 49.49/40.15 [2019-03-28 12:06:06,247 INFO L518 LassoAnalysis]: Proved termination. 49.49/40.15 [2019-03-28 12:06:06,248 INFO L520 LassoAnalysis]: Termination argument consisting of: 49.49/40.15 Ranking function f(bsearch_#in~j, bsearch_#in~i) = 1*bsearch_#in~j - 1*bsearch_#in~i 49.49/40.15 Supporting invariants [] 49.49/40.15 [2019-03-28 12:06:06,249 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 49.49/40.15 [2019-03-28 12:06:06,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.49/40.15 [2019-03-28 12:06:06,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core 49.49/40.15 [2019-03-28 12:06:06,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.49/40.15 [2019-03-28 12:06:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.49/40.15 [2019-03-28 12:06:06,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core 49.49/40.15 [2019-03-28 12:06:06,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.49/40.15 [2019-03-28 12:06:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.49/40.15 [2019-03-28 12:06:06,398 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 49.49/40.15 [2019-03-28 12:06:06,403 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 49.49/40.15 [2019-03-28 12:06:06,404 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. 49.49/40.15 [2019-03-28 12:06:12,591 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 82 states and 153 transitions. Complement of second has 16 states. 49.49/40.15 [2019-03-28 12:06:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 49.49/40.15 [2019-03-28 12:06:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 49.49/40.15 [2019-03-28 12:06:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. 49.49/40.15 [2019-03-28 12:06:12,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 2 letters. Loop has 4 letters. 49.49/40.15 [2019-03-28 12:06:12,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:12,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. 49.49/40.15 [2019-03-28 12:06:12,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:12,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 2 letters. Loop has 8 letters. 49.49/40.15 [2019-03-28 12:06:12,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:12,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 153 transitions. 49.49/40.15 [2019-03-28 12:06:12,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 49.49/40.15 [2019-03-28 12:06:12,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 27 states and 43 transitions. 49.49/40.15 [2019-03-28 12:06:12,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 49.49/40.15 [2019-03-28 12:06:12,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 49.49/40.15 [2019-03-28 12:06:12,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 43 transitions. 49.49/40.15 [2019-03-28 12:06:12,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.49/40.15 [2019-03-28 12:06:12,644 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 43 transitions. 49.49/40.15 [2019-03-28 12:06:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 43 transitions. 49.49/40.15 [2019-03-28 12:06:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. 49.49/40.15 [2019-03-28 12:06:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 49.49/40.15 [2019-03-28 12:06:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. 49.49/40.15 [2019-03-28 12:06:12,675 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. 49.49/40.15 [2019-03-28 12:06:12,675 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. 49.49/40.15 [2019-03-28 12:06:12,676 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 49.49/40.15 [2019-03-28 12:06:12,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. 49.49/40.15 [2019-03-28 12:06:12,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 49.49/40.15 [2019-03-28 12:06:12,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.49/40.15 [2019-03-28 12:06:12,677 INFO L119 BuchiIsEmpty]: Starting construction of run 49.49/40.15 [2019-03-28 12:06:12,677 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:12,677 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:12,678 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 151#L21 [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 155#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 163#L10 [47] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (>= .cse0 0) (> v_bsearch_~j_3 v_bsearch_~i_3))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 159#L12 49.49/40.15 [2019-03-28 12:06:12,679 INFO L796 eck$LassoCheckResult]: Loop: 159#L12 [51] L12-->L13: Formula: (> 0 |v_bsearch_#t~nondet0_2|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_2|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_1|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 152#L13 [40] L13-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_1| v_bsearch_~mid~0_4) (= |v_bsearch_#in~iInParam_1| v_bsearch_~i_5)) InVars {bsearch_~mid~0=v_bsearch_~mid~0_4, bsearch_~i=v_bsearch_~i_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_1|, bsearch_#in~i=|v_bsearch_#in~iInParam_1|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 161#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 157#L10 [48] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (> v_bsearch_~j_3 v_bsearch_~i_3) (= (mod .cse0 2) 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 159#L12 49.49/40.15 [2019-03-28 12:06:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2030826, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:12,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2482497, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:12,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1388691030, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:12,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:12,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:12,872 INFO L216 LassoAnalysis]: Preferences: 49.49/40.15 [2019-03-28 12:06:12,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.49/40.15 [2019-03-28 12:06:12,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.49/40.15 [2019-03-28 12:06:12,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.49/40.15 [2019-03-28 12:06:12,873 INFO L127 ssoRankerPreferences]: Use exernal solver: true 49.49/40.15 [2019-03-28 12:06:12,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:12,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.49/40.15 [2019-03-28 12:06:12,874 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.49/40.15 [2019-03-28 12:06:12,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 49.49/40.15 [2019-03-28 12:06:12,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.49/40.15 [2019-03-28 12:06:12,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.49/40.15 [2019-03-28 12:06:12,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:12,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:12,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:12,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:12,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:13,077 INFO L300 LassoAnalysis]: Preprocessing complete. 49.49/40.15 [2019-03-28 12:06:13,077 INFO L412 LassoAnalysis]: Checking for nontermination... 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:13,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:13,084 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 [2019-03-28 12:06:13,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. 49.49/40.15 [2019-03-28 12:06:13,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#t~ret2=0} Honda state: {bsearch_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:13,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:13,119 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 [2019-03-28 12:06:13,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. 49.49/40.15 [2019-03-28 12:06:13,123 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#t~ret1=0} Honda state: {bsearch_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:13,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:13,153 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 [2019-03-28 12:06:13,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. 49.49/40.15 [2019-03-28 12:06:13,157 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#res=0} Honda state: {bsearch_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:13,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:13,198 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:13,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:13,247 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 [2019-03-28 12:06:25,300 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 49.49/40.15 [2019-03-28 12:06:25,307 INFO L216 LassoAnalysis]: Preferences: 49.49/40.15 [2019-03-28 12:06:25,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.49/40.15 [2019-03-28 12:06:25,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.49/40.15 [2019-03-28 12:06:25,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.49/40.15 [2019-03-28 12:06:25,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false 49.49/40.15 [2019-03-28 12:06:25,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:25,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.49/40.15 [2019-03-28 12:06:25,308 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.49/40.15 [2019-03-28 12:06:25,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 49.49/40.15 [2019-03-28 12:06:25,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.49/40.15 [2019-03-28 12:06:25,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.49/40.15 [2019-03-28 12:06:25,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,488 INFO L300 LassoAnalysis]: Preprocessing complete. 49.49/40.15 [2019-03-28 12:06:25,489 INFO L497 LassoAnalysis]: Using template 'affine'. 49.49/40.15 [2019-03-28 12:06:25,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.49/40.15 Termination analysis: LINEAR_WITH_GUESSES 49.49/40.15 Number of strict supporting invariants: 0 49.49/40.15 Number of non-strict supporting invariants: 1 49.49/40.15 Consider only non-deceasing supporting invariants: true 49.49/40.15 Simplify termination arguments: true 49.49/40.15 Simplify supporting invariants: trueOverapproximate stem: false 49.49/40.15 [2019-03-28 12:06:25,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.49/40.15 [2019-03-28 12:06:25,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.49/40.15 [2019-03-28 12:06:25,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.49/40.15 [2019-03-28 12:06:25,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.49/40.15 [2019-03-28 12:06:25,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.49/40.15 [2019-03-28 12:06:25,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.49/40.15 [2019-03-28 12:06:25,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.49/40.15 [2019-03-28 12:06:25,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.49/40.15 [2019-03-28 12:06:25,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.49/40.15 Termination analysis: LINEAR_WITH_GUESSES 49.49/40.15 Number of strict supporting invariants: 0 49.49/40.15 Number of non-strict supporting invariants: 1 49.49/40.15 Consider only non-deceasing supporting invariants: true 49.49/40.15 Simplify termination arguments: true 49.49/40.15 Simplify supporting invariants: trueOverapproximate stem: false 49.49/40.15 [2019-03-28 12:06:25,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.49/40.15 [2019-03-28 12:06:25,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.49/40.15 [2019-03-28 12:06:25,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.49/40.15 [2019-03-28 12:06:25,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.49/40.15 [2019-03-28 12:06:25,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.49/40.15 [2019-03-28 12:06:25,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.49/40.15 [2019-03-28 12:06:25,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.49/40.15 [2019-03-28 12:06:25,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.49/40.15 [2019-03-28 12:06:25,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.49/40.15 Termination analysis: LINEAR_WITH_GUESSES 49.49/40.15 Number of strict supporting invariants: 0 49.49/40.15 Number of non-strict supporting invariants: 1 49.49/40.15 Consider only non-deceasing supporting invariants: true 49.49/40.15 Simplify termination arguments: true 49.49/40.15 Simplify supporting invariants: trueOverapproximate stem: false 49.49/40.15 [2019-03-28 12:06:25,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.49/40.15 [2019-03-28 12:06:25,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.49/40.15 [2019-03-28 12:06:25,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.49/40.15 [2019-03-28 12:06:25,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.49/40.15 [2019-03-28 12:06:25,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.49/40.15 [2019-03-28 12:06:25,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.49/40.15 [2019-03-28 12:06:25,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.49/40.15 [2019-03-28 12:06:25,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.49/40.15 [2019-03-28 12:06:25,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.49/40.15 Termination analysis: LINEAR_WITH_GUESSES 49.49/40.15 Number of strict supporting invariants: 0 49.49/40.15 Number of non-strict supporting invariants: 1 49.49/40.15 Consider only non-deceasing supporting invariants: true 49.49/40.15 Simplify termination arguments: true 49.49/40.15 Simplify supporting invariants: trueOverapproximate stem: false 49.49/40.15 [2019-03-28 12:06:25,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.49/40.15 [2019-03-28 12:06:25,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.49/40.15 [2019-03-28 12:06:25,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.49/40.15 [2019-03-28 12:06:25,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.49/40.15 [2019-03-28 12:06:25,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.49/40.15 [2019-03-28 12:06:25,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.49/40.15 [2019-03-28 12:06:25,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.49/40.15 [2019-03-28 12:06:25,515 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 49.49/40.15 [2019-03-28 12:06:25,527 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 49.49/40.15 [2019-03-28 12:06:25,527 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 49.49/40.15 [2019-03-28 12:06:25,528 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 49.49/40.15 [2019-03-28 12:06:25,528 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 49.49/40.15 [2019-03-28 12:06:25,528 INFO L518 LassoAnalysis]: Proved termination. 49.49/40.15 [2019-03-28 12:06:25,528 INFO L520 LassoAnalysis]: Termination argument consisting of: 49.49/40.15 Ranking function f(bsearch_~mid~0, bsearch_~i) = 1*bsearch_~mid~0 - 1*bsearch_~i 49.49/40.15 Supporting invariants [] 49.49/40.15 [2019-03-28 12:06:25,529 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 49.49/40.15 [2019-03-28 12:06:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.49/40.15 [2019-03-28 12:06:25,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 49.49/40.15 [2019-03-28 12:06:25,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.49/40.15 [2019-03-28 12:06:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.49/40.15 [2019-03-28 12:06:25,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core 49.49/40.15 [2019-03-28 12:06:25,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.49/40.15 [2019-03-28 12:06:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.49/40.15 [2019-03-28 12:06:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,638 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.49/40.15 [2019-03-28 12:06:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,648 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.49/40.15 [2019-03-28 12:06:25,649 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 49.49/40.15 [2019-03-28 12:06:25,649 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 49.49/40.15 [2019-03-28 12:06:25,649 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 23 transitions. cyclomatic complexity: 11 Second operand 5 states. 49.49/40.15 [2019-03-28 12:06:25,743 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 23 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 154 states and 260 transitions. Complement of second has 82 states. 49.49/40.15 [2019-03-28 12:06:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 49.49/40.15 [2019-03-28 12:06:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 49.49/40.15 [2019-03-28 12:06:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. 49.49/40.15 [2019-03-28 12:06:25,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. 49.49/40.15 [2019-03-28 12:06:25,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 4 letters. 49.49/40.15 [2019-03-28 12:06:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 8 letters. 49.49/40.15 [2019-03-28 12:06:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:25,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 260 transitions. 49.49/40.15 [2019-03-28 12:06:25,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 49.49/40.15 [2019-03-28 12:06:25,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 76 states and 137 transitions. 49.49/40.15 [2019-03-28 12:06:25,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 49.49/40.15 [2019-03-28 12:06:25,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 49.49/40.15 [2019-03-28 12:06:25,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 137 transitions. 49.49/40.15 [2019-03-28 12:06:25,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.49/40.15 [2019-03-28 12:06:25,759 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 137 transitions. 49.49/40.15 [2019-03-28 12:06:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 137 transitions. 49.49/40.15 [2019-03-28 12:06:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 24. 49.49/40.15 [2019-03-28 12:06:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 49.49/40.15 [2019-03-28 12:06:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. 49.49/40.15 [2019-03-28 12:06:25,765 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 46 transitions. 49.49/40.15 [2019-03-28 12:06:25,765 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 46 transitions. 49.49/40.15 [2019-03-28 12:06:25,765 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 49.49/40.15 [2019-03-28 12:06:25,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 46 transitions. 49.49/40.15 [2019-03-28 12:06:25,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 49.49/40.15 [2019-03-28 12:06:25,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.49/40.15 [2019-03-28 12:06:25,767 INFO L119 BuchiIsEmpty]: Starting construction of run 49.49/40.15 [2019-03-28 12:06:25,767 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:25,767 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:25,767 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 451#L21 [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 452#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 466#L10 [49] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (+ (div .cse0 2) 1) v_bsearch_~mid~0_1) (> (mod .cse0 2) 0) (> v_bsearch_~j_3 v_bsearch_~i_3) (< .cse0 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 467#L12 49.49/40.15 [2019-03-28 12:06:25,768 INFO L796 eck$LassoCheckResult]: Loop: 467#L12 [28] L12-->L14: Formula: (= 0 |v_bsearch_#t~nondet0_4|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_4|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_3|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 448#L14 [38] L14-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~iInParam_2| (+ v_bsearch_~mid~0_5 1)) (= |v_bsearch_#in~jInParam_2| v_bsearch_~j_5)) InVars {bsearch_~j=v_bsearch_~j_5, bsearch_~mid~0=v_bsearch_~mid~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_2|, bsearch_#in~i=|v_bsearch_#in~iInParam_2|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 457#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 459#L10 [48] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (div .cse0 2) v_bsearch_~mid~0_1) (> v_bsearch_~j_3 v_bsearch_~i_3) (= (mod .cse0 2) 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 467#L12 49.49/40.15 [2019-03-28 12:06:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2030828, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:25,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:25,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:25,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1795382, now seen corresponding path program 2 times 49.49/40.15 [2019-03-28 12:06:25,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1387531103, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:25,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:25,925 INFO L216 LassoAnalysis]: Preferences: 49.49/40.15 [2019-03-28 12:06:25,926 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.49/40.15 [2019-03-28 12:06:25,926 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.49/40.15 [2019-03-28 12:06:25,926 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.49/40.15 [2019-03-28 12:06:25,926 INFO L127 ssoRankerPreferences]: Use exernal solver: true 49.49/40.15 [2019-03-28 12:06:25,926 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:25,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.49/40.15 [2019-03-28 12:06:25,926 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.49/40.15 [2019-03-28 12:06:25,927 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 49.49/40.15 [2019-03-28 12:06:25,927 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.49/40.15 [2019-03-28 12:06:25,927 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.49/40.15 [2019-03-28 12:06:25,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:25,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:26,106 INFO L300 LassoAnalysis]: Preprocessing complete. 49.49/40.15 [2019-03-28 12:06:26,106 INFO L412 LassoAnalysis]: Checking for nontermination... 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:26,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:26,112 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 [2019-03-28 12:06:26,117 INFO L445 LassoAnalysis]: Proved nontermination for one component. 49.49/40.15 [2019-03-28 12:06:26,117 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {bsearch_#t~nondet0=0} Honda state: {bsearch_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:26,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:26,147 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 49.49/40.15 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 49.49/40.15 [2019-03-28 12:06:26,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 49.49/40.15 [2019-03-28 12:06:26,196 INFO L163 nArgumentSynthesizer]: Using integer mode. 49.49/40.15 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:38,248 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 49.49/40.15 [2019-03-28 12:06:38,253 INFO L216 LassoAnalysis]: Preferences: 49.49/40.15 [2019-03-28 12:06:38,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.49/40.15 [2019-03-28 12:06:38,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.49/40.15 [2019-03-28 12:06:38,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.49/40.15 [2019-03-28 12:06:38,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false 49.49/40.15 [2019-03-28 12:06:38,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 49.49/40.15 [2019-03-28 12:06:38,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.49/40.15 [2019-03-28 12:06:38,254 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.49/40.15 [2019-03-28 12:06:38,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 49.49/40.15 [2019-03-28 12:06:38,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.49/40.15 [2019-03-28 12:06:38,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.49/40.15 [2019-03-28 12:06:38,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:38,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:38,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:38,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:38,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.49/40.15 [2019-03-28 12:06:38,417 INFO L300 LassoAnalysis]: Preprocessing complete. 49.49/40.15 [2019-03-28 12:06:38,417 INFO L497 LassoAnalysis]: Using template 'affine'. 49.49/40.15 [2019-03-28 12:06:38,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.49/40.15 Termination analysis: LINEAR_WITH_GUESSES 49.49/40.15 Number of strict supporting invariants: 0 49.49/40.15 Number of non-strict supporting invariants: 1 49.49/40.15 Consider only non-deceasing supporting invariants: true 49.49/40.15 Simplify termination arguments: true 49.49/40.15 Simplify supporting invariants: trueOverapproximate stem: false 49.49/40.15 [2019-03-28 12:06:38,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.49/40.15 [2019-03-28 12:06:38,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.49/40.15 [2019-03-28 12:06:38,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.49/40.15 [2019-03-28 12:06:38,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.49/40.15 [2019-03-28 12:06:38,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.49/40.15 [2019-03-28 12:06:38,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.49/40.15 [2019-03-28 12:06:38,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.49/40.15 [2019-03-28 12:06:38,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 49.49/40.15 [2019-03-28 12:06:38,436 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 49.49/40.15 [2019-03-28 12:06:38,436 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 49.49/40.15 [2019-03-28 12:06:38,437 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 49.49/40.15 [2019-03-28 12:06:38,437 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 49.49/40.15 [2019-03-28 12:06:38,437 INFO L518 LassoAnalysis]: Proved termination. 49.49/40.15 [2019-03-28 12:06:38,437 INFO L520 LassoAnalysis]: Termination argument consisting of: 49.49/40.15 Ranking function f(bsearch_~mid~0, bsearch_~j) = -1*bsearch_~mid~0 + 1*bsearch_~j 49.49/40.15 Supporting invariants [] 49.49/40.15 [2019-03-28 12:06:38,438 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 49.49/40.15 [2019-03-28 12:06:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.49/40.15 [2019-03-28 12:06:38,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core 49.49/40.15 [2019-03-28 12:06:38,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.49/40.15 [2019-03-28 12:06:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.49/40.15 [2019-03-28 12:06:38,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core 49.49/40.15 [2019-03-28 12:06:38,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.49/40.15 [2019-03-28 12:06:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.49/40.15 [2019-03-28 12:06:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,507 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.49/40.15 [2019-03-28 12:06:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,516 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.49/40.15 [2019-03-28 12:06:38,516 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 49.49/40.15 [2019-03-28 12:06:38,516 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 49.49/40.15 [2019-03-28 12:06:38,517 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 46 transitions. cyclomatic complexity: 24 Second operand 5 states. 49.49/40.15 [2019-03-28 12:06:38,571 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 46 transitions. cyclomatic complexity: 24. Second operand 5 states. Result 99 states and 184 transitions. Complement of second has 39 states. 49.49/40.15 [2019-03-28 12:06:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 49.49/40.15 [2019-03-28 12:06:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 49.49/40.15 [2019-03-28 12:06:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. 49.49/40.15 [2019-03-28 12:06:38,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 4 letters. 49.49/40.15 [2019-03-28 12:06:38,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:38,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. 49.49/40.15 [2019-03-28 12:06:38,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:38,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 8 letters. 49.49/40.15 [2019-03-28 12:06:38,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.49/40.15 [2019-03-28 12:06:38,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 184 transitions. 49.49/40.15 [2019-03-28 12:06:38,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 49.49/40.15 [2019-03-28 12:06:38,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 51 states and 95 transitions. 49.49/40.15 [2019-03-28 12:06:38,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 49.49/40.15 [2019-03-28 12:06:38,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 49.49/40.15 [2019-03-28 12:06:38,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 95 transitions. 49.49/40.15 [2019-03-28 12:06:38,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.49/40.15 [2019-03-28 12:06:38,583 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 95 transitions. 49.49/40.15 [2019-03-28 12:06:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 95 transitions. 49.49/40.15 [2019-03-28 12:06:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. 49.49/40.15 [2019-03-28 12:06:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 49.49/40.15 [2019-03-28 12:06:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. 49.49/40.15 [2019-03-28 12:06:38,587 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 62 transitions. 49.49/40.15 [2019-03-28 12:06:38,587 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 62 transitions. 49.49/40.15 [2019-03-28 12:06:38,587 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 49.49/40.15 [2019-03-28 12:06:38,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 62 transitions. 49.49/40.15 [2019-03-28 12:06:38,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 49.49/40.15 [2019-03-28 12:06:38,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.49/40.15 [2019-03-28 12:06:38,588 INFO L119 BuchiIsEmpty]: Starting construction of run 49.49/40.15 [2019-03-28 12:06:38,589 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:38,589 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 49.49/40.15 [2019-03-28 12:06:38,589 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L21: Formula: (and (= v_ULTIMATE.start_main_~x~0_2 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet4_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|, |v_ULTIMATE.start_main_#t~nondet3_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 653#L21 [35] L21-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_3| v_ULTIMATE.start_main_~y~0_5) (= |v_bsearch_#in~iInParam_3| v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_3|, bsearch_#in~i=|v_bsearch_#in~iInParam_3|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 658#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 678#L10 [49] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (+ (div .cse0 2) 1) v_bsearch_~mid~0_1) (> (mod .cse0 2) 0) (> v_bsearch_~j_3 v_bsearch_~i_3) (< .cse0 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 676#L12 49.49/40.15 [2019-03-28 12:06:38,589 INFO L796 eck$LassoCheckResult]: Loop: 676#L12 [51] L12-->L13: Formula: (> 0 |v_bsearch_#t~nondet0_2|) InVars {bsearch_#t~nondet0=|v_bsearch_#t~nondet0_2|} OutVars{bsearch_#t~nondet0=|v_bsearch_#t~nondet0_1|} AuxVars[] AssignedVars[bsearch_#t~nondet0] 655#L13 [40] L13-->bsearchENTRY: Formula: (and (= |v_bsearch_#in~jInParam_1| v_bsearch_~mid~0_4) (= |v_bsearch_#in~iInParam_1| v_bsearch_~i_5)) InVars {bsearch_~mid~0=v_bsearch_~mid~0_4, bsearch_~i=v_bsearch_~i_5} OutVars{bsearch_#in~j=|v_bsearch_#in~jInParam_1|, bsearch_#in~i=|v_bsearch_#in~iInParam_1|} AuxVars[] AssignedVars[bsearch_#in~j, bsearch_#in~i]< 669#bsearchENTRY [37] bsearchENTRY-->L10: Formula: (and (= v_bsearch_~i_1 |v_bsearch_#in~i_1|) (= v_bsearch_~j_1 |v_bsearch_#in~j_1|)) InVars {bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_#in~i=|v_bsearch_#in~i_1|} OutVars{bsearch_~j=v_bsearch_~j_1, bsearch_#in~i=|v_bsearch_#in~i_1|, bsearch_#in~j=|v_bsearch_#in~j_1|, bsearch_~i=v_bsearch_~i_1} AuxVars[] AssignedVars[bsearch_~i, bsearch_~j] 675#L10 [49] L10-->L12: Formula: (let ((.cse0 (+ v_bsearch_~j_3 v_bsearch_~i_3))) (and (= (+ (div .cse0 2) 1) v_bsearch_~mid~0_1) (> (mod .cse0 2) 0) (> v_bsearch_~j_3 v_bsearch_~i_3) (< .cse0 0))) InVars {bsearch_~j=v_bsearch_~j_3, bsearch_~i=v_bsearch_~i_3} OutVars{bsearch_~j=v_bsearch_~j_3, bsearch_~mid~0=v_bsearch_~mid~0_1, bsearch_~i=v_bsearch_~i_3} AuxVars[] AssignedVars[bsearch_~mid~0] 676#L12 49.49/40.15 [2019-03-28 12:06:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2030828, now seen corresponding path program 2 times 49.49/40.15 [2019-03-28 12:06:38,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:38,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:38,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2482498, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:38,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:38,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:38,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.49/40.15 [2019-03-28 12:06:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1386843987, now seen corresponding path program 1 times 49.49/40.15 [2019-03-28 12:06:38,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.49/40.15 [2019-03-28 12:06:38,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.49/40.15 [2019-03-28 12:06:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.49/40.15 [2019-03-28 12:06:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.49/40.15 [2019-03-28 12:06:38,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:38 BasicIcfg 49.49/40.15 [2019-03-28 12:06:38,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 49.49/40.15 [2019-03-28 12:06:38,851 INFO L168 Benchmark]: Toolchain (without parser) took 34669.34 ms. Allocated memory was 649.6 MB in the beginning and 746.6 MB in the end (delta: 97.0 MB). Free memory was 559.6 MB in the beginning and 498.9 MB in the end (delta: 60.7 MB). Peak memory consumption was 157.7 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,853 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.49 ms. Allocated memory is still 649.6 MB. Free memory was 559.6 MB in the beginning and 550.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.32 ms. Allocated memory was 649.6 MB in the beginning and 664.8 MB in the end (delta: 15.2 MB). Free memory was 550.0 MB in the beginning and 630.7 MB in the end (delta: -80.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,855 INFO L168 Benchmark]: Boogie Preprocessor took 17.25 ms. Allocated memory is still 664.8 MB. Free memory is still 629.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,855 INFO L168 Benchmark]: RCFGBuilder took 211.94 ms. Allocated memory is still 664.8 MB. Free memory was 629.3 MB in the beginning and 615.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,856 INFO L168 Benchmark]: BlockEncodingV2 took 80.78 ms. Allocated memory is still 664.8 MB. Free memory was 615.1 MB in the beginning and 609.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,856 INFO L168 Benchmark]: TraceAbstraction took 165.46 ms. Allocated memory is still 664.8 MB. Free memory was 609.7 MB in the beginning and 598.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,857 INFO L168 Benchmark]: BuchiAutomizer took 33872.74 ms. Allocated memory was 664.8 MB in the beginning and 746.6 MB in the end (delta: 81.8 MB). Free memory was 598.8 MB in the beginning and 498.9 MB in the end (delta: 99.9 MB). Peak memory consumption was 181.7 MB. Max. memory is 50.3 GB. 49.49/40.15 [2019-03-28 12:06:38,861 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 49.49/40.15 --- Results --- 49.49/40.15 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 49.49/40.15 - StatisticsResult: Initial Icfg 49.49/40.15 15 locations, 18 edges 49.49/40.15 - StatisticsResult: Encoded RCFG 49.49/40.15 11 locations, 18 edges 49.49/40.15 * Results from de.uni_freiburg.informatik.ultimate.core: 49.49/40.15 - StatisticsResult: Toolchain Benchmarks 49.49/40.15 Benchmark results are: 49.49/40.15 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 49.49/40.15 * CACSL2BoogieTranslator took 224.49 ms. Allocated memory is still 649.6 MB. Free memory was 559.6 MB in the beginning and 550.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 49.49/40.15 * Boogie Procedure Inliner took 91.32 ms. Allocated memory was 649.6 MB in the beginning and 664.8 MB in the end (delta: 15.2 MB). Free memory was 550.0 MB in the beginning and 630.7 MB in the end (delta: -80.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 49.49/40.15 * Boogie Preprocessor took 17.25 ms. Allocated memory is still 664.8 MB. Free memory is still 629.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 49.49/40.15 * RCFGBuilder took 211.94 ms. Allocated memory is still 664.8 MB. Free memory was 629.3 MB in the beginning and 615.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 49.49/40.15 * BlockEncodingV2 took 80.78 ms. Allocated memory is still 664.8 MB. Free memory was 615.1 MB in the beginning and 609.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 49.49/40.15 * TraceAbstraction took 165.46 ms. Allocated memory is still 664.8 MB. Free memory was 609.7 MB in the beginning and 598.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 49.49/40.15 * BuchiAutomizer took 33872.74 ms. Allocated memory was 664.8 MB in the beginning and 746.6 MB in the end (delta: 81.8 MB). Free memory was 598.8 MB in the beginning and 498.9 MB in the end (delta: 99.9 MB). Peak memory consumption was 181.7 MB. Max. memory is 50.3 GB. 49.49/40.15 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 49.49/40.15 - AllSpecificationsHoldResult: All specifications hold 49.49/40.15 We were not able to verify any specifiation because the program does not contain any specification. 49.49/40.15 - StatisticsResult: Ultimate Automizer benchmark data 49.49/40.15 CFG has 2 procedures, 11 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 49.49/40.15 - StatisticsResult: Constructed decomposition of program 49.49/40.15 Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(j) + -1 * \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function mid + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * mid + j and consists of 5 locations. The remainder module has 30 locations. 49.49/40.15 - StatisticsResult: Timing statistics 49.49/40.15 BüchiAutomizer plugin needed 33.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 26.9s. Construction of modules took 5.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 86 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 81 SDslu, 29 SDs, 0 SdLazy, 101 SolverSat, 15 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div388 bol100 ite100 ukn100 eq136 hnf48 smp72 dnf100 smp100 tf103 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 24.7s 49.49/40.15 - TerminationAnalysisResult: Nontermination possible 49.49/40.15 Buchi Automizer proved that your program is nonterminating for some inputs 49.49/40.15 - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. 49.49/40.15 Nontermination argument in form of an infinite execution 49.49/40.15 State at position 0 is 49.49/40.15 {} 49.49/40.15 State at position 1 is 49.49/40.15 {\old(j)=0, \result=0, \result=0, \old(i)=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24483546=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6478cbbc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33bfca57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bdc6314=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31d99871=0, NULL=0, i=-1, mid=0, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1628b7cc=-1, x=0, y=0} 49.49/40.15 - StatisticsResult: NonterminationArgumentStatistics 49.49/40.15 Fixpoint 49.49/40.15 - NonterminatingLassoResult [Line: 12]: Nonterminating execution 49.49/40.15 Found a nonterminating execution for the following lasso shaped sequence of statements. 49.49/40.15 Stem: 49.49/40.15 [L19] int x = __VERIFIER_nondet_int(); 49.49/40.15 [L20] int y = __VERIFIER_nondet_int(); 49.49/40.15 [L21] CALL bsearch(x, y) 49.49/40.15 [L10] COND FALSE !(i>=j) 49.49/40.15 [L11] int mid = (i+j)/2; 49.49/40.15 Loop: 49.49/40.15 [L12] COND TRUE __VERIFIER_nondet_int() 49.49/40.15 [L13] CALL bsearch(i,mid) 49.49/40.15 [L10] COND FALSE !(i>=j) 49.49/40.15 [L11] int mid = (i+j)/2; 49.49/40.15 End of lasso representation. 49.49/40.15 RESULT: Ultimate proved your program to be incorrect! 49.49/40.15 !SESSION 2019-03-28 12:05:59.726 ----------------------------------------------- 49.49/40.15 eclipse.buildId=unknown 49.49/40.15 java.version=1.8.0_181 49.49/40.15 java.vendor=Oracle Corporation 49.49/40.15 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 49.49/40.15 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 49.49/40.15 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 49.49/40.15 49.49/40.15 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:06:39.096 49.49/40.15 !MESSAGE The workspace will exit with unsaved changes in this session. 49.49/40.15 Received shutdown request... 49.49/40.15 Ultimate: 49.49/40.15 GTK+ Version Check 49.49/40.15 EOF