./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/sep05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/reducercommutativity/sep05_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0de1e24b39a951a670bac9cdad830e10aacf376 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:18,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:18,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:18,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:18,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:18,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:18,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:18,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:18,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:18,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:18,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:18,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:18,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:18,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:18,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:18,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:18,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:18,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:18,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:18,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:18,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:18,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:18,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:18,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:18,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:18,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:18,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:18,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:18,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:18,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:18,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:18,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:18,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:18,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:18,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:18,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:18,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:18,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:18,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:18,231 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:18,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:18,232 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:18,232 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:18,232 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:18,232 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:18,233 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:18,233 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:18,233 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:18,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:18,233 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:18,233 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:18,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:18,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:18,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:18,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:18,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:18,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:18,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:18,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:18,235 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:18,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:18,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:18,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:18,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:18,236 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:18,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:18,236 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:18,236 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:18,237 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:18,237 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0de1e24b39a951a670bac9cdad830e10aacf376 [2018-11-29 00:10:18,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:18,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:18,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:18,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:18,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:18,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-11-29 00:10:18,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad7305ad/c11ebe443ad14195b128d71ca5f62b53/FLAG82eb7b656 [2018-11-29 00:10:18,875 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:18,876 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-11-29 00:10:18,882 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad7305ad/c11ebe443ad14195b128d71ca5f62b53/FLAG82eb7b656 [2018-11-29 00:10:19,210 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad7305ad/c11ebe443ad14195b128d71ca5f62b53 [2018-11-29 00:10:19,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:19,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:19,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:19,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:19,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:19,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2198231d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19, skipping insertion in model container [2018-11-29 00:10:19,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:19,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:19,492 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:19,512 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:19,557 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:19,571 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:19,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19 WrapperNode [2018-11-29 00:10:19,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:19,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:19,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:19,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:19,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:19,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:19,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:19,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:19,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... [2018-11-29 00:10:19,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:19,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:19,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:19,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:19,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:19,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:20,347 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:20,348 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-29 00:10:20,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:20 BoogieIcfgContainer [2018-11-29 00:10:20,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:20,349 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:20,349 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:20,354 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:20,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:20,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:19" (1/3) ... [2018-11-29 00:10:20,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ccde5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:20, skipping insertion in model container [2018-11-29 00:10:20,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:20,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:19" (2/3) ... [2018-11-29 00:10:20,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ccde5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:20, skipping insertion in model container [2018-11-29 00:10:20,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:20,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:20" (3/3) ... [2018-11-29 00:10:20,361 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep05_true-unreach-call_true-termination.i [2018-11-29 00:10:20,417 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:20,418 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:20,418 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:20,418 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:20,420 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:20,420 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:20,420 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:20,420 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:20,421 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:20,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-29 00:10:20,459 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-29 00:10:20,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:20,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:20,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:10:20,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:20,466 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:20,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-29 00:10:20,469 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-29 00:10:20,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:20,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:20,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:10:20,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:20,478 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 28#L26-3true [2018-11-29 00:10:20,479 INFO L796 eck$LassoCheckResult]: Loop: 28#L26-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 29#L26-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 28#L26-3true [2018-11-29 00:10:20,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-29 00:10:20,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-29 00:10:20,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-29 00:10:20,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:20,941 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-29 00:10:21,002 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:21,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:21,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:21,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:21,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:21,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:21,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:21,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:21,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-29 00:10:21,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:21,005 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:21,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,434 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-29 00:10:21,600 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-29 00:10:21,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:21,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:22,292 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:10:22,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:22,325 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:22,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:22,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:22,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:22,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:22,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,401 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:22,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,404 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:22,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:22,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:22,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:22,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:22,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:22,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:22,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:22,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:22,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:22,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:22,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:22,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:22,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:22,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:22,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:22,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:22,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:22,635 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-29 00:10:22,638 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:10:22,640 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:22,642 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:22,642 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:22,643 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2018-11-29 00:10:22,652 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-29 00:10:22,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:22,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:22,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:22,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:22,905 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:22,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2018-11-29 00:10:23,062 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 75 states and 110 transitions. Complement of second has 8 states. [2018-11-29 00:10:23,064 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 [2018-11-29 00:10:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-29 00:10:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-29 00:10:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:23,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-29 00:10:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:23,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:10:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:23,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2018-11-29 00:10:23,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:23,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2018-11-29 00:10:23,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:10:23,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:23,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-29 00:10:23,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:23,085 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-29 00:10:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-29 00:10:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-29 00:10:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:10:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-29 00:10:23,114 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-29 00:10:23,115 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-29 00:10:23,115 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:23,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-29 00:10:23,116 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:23,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:23,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:23,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:23,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:23,117 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 160#L26-3 assume !(main_~i~1 < 5); 164#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 150#L7-3 [2018-11-29 00:10:23,118 INFO L796 eck$LassoCheckResult]: Loop: 150#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 156#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 149#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 150#L7-3 [2018-11-29 00:10:23,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:23,118 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-29 00:10:23,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:23,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:23,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:23,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:23,202 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:23,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:23,203 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2018-11-29 00:10:23,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:23,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:23,415 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-29 00:10:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:23,420 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:23,438 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-11-29 00:10:23,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:23,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-29 00:10:23,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:23,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-11-29 00:10:23,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:10:23,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:23,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-29 00:10:23,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:23,442 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-29 00:10:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-29 00:10:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-29 00:10:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:10:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-11-29 00:10:23,445 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-29 00:10:23,445 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-29 00:10:23,445 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:23,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2018-11-29 00:10:23,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:23,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:23,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:23,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:23,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:23,447 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 210#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 216#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 217#L26-3 assume !(main_~i~1 < 5); 215#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 202#L7-3 [2018-11-29 00:10:23,447 INFO L796 eck$LassoCheckResult]: Loop: 202#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 207#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 201#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 202#L7-3 [2018-11-29 00:10:23,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-29 00:10:23,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:23,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:23,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:23,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:23,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:23,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:23,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:23,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-29 00:10:23,614 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:23,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2018-11-29 00:10:23,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:23,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:23,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:23,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:23,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:23,803 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-29 00:10:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:23,911 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-29 00:10:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:23,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-29 00:10:23,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:23,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-11-29 00:10:23,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:10:23,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:23,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-29 00:10:23,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:23,914 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-29 00:10:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-29 00:10:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-29 00:10:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-29 00:10:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-11-29 00:10:23,917 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-29 00:10:23,918 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-29 00:10:23,918 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:23,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2018-11-29 00:10:23,919 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:23,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:23,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:23,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-29 00:10:23,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:23,920 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 280#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 281#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 286#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 287#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 288#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 291#L26-3 assume !(main_~i~1 < 5); 285#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 271#L7-3 [2018-11-29 00:10:23,920 INFO L796 eck$LassoCheckResult]: Loop: 271#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 277#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 270#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 271#L7-3 [2018-11-29 00:10:23,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-29 00:10:23,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:23,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:24,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:24,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:24,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:24,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:24,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:24,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:24,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:24,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-29 00:10:24,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:24,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:24,150 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2018-11-29 00:10:24,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:24,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:24,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:24,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,403 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:10:24,588 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-29 00:10:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:24,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:24,589 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-29 00:10:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:24,619 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-29 00:10:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:24,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-29 00:10:24,623 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:24,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2018-11-29 00:10:24,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:10:24,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:24,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-29 00:10:24,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:24,624 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-29 00:10:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-29 00:10:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-29 00:10:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-29 00:10:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-29 00:10:24,627 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-29 00:10:24,627 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-29 00:10:24,627 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:24,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-29 00:10:24,628 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:24,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:24,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:24,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-29 00:10:24,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:24,629 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 360#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 367#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 368#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 369#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 374#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 373#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 372#L26-3 assume !(main_~i~1 < 5); 366#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 352#L7-3 [2018-11-29 00:10:24,630 INFO L796 eck$LassoCheckResult]: Loop: 352#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 358#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 351#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 352#L7-3 [2018-11-29 00:10:24,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-29 00:10:24,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:24,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:10:24,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-29 00:10:24,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:24,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:24,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:24,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-29 00:10:24,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:24,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:24,785 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2018-11-29 00:10:24,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:24,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:24,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:24,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,016 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:10:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:10:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:10:25,081 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-29 00:10:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:25,113 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-29 00:10:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:25,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-11-29 00:10:25,118 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:25,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2018-11-29 00:10:25,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:10:25,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:25,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-11-29 00:10:25,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:25,119 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-29 00:10:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-11-29 00:10:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-29 00:10:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-29 00:10:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-29 00:10:25,125 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-29 00:10:25,125 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-29 00:10:25,125 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:25,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2018-11-29 00:10:25,126 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:25,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:25,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:25,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-29 00:10:25,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:25,128 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 451#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 452#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 459#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 460#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 461#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 462#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 468#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 467#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 466#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 465#L26-3 assume !(main_~i~1 < 5); 458#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 444#L7-3 [2018-11-29 00:10:25,129 INFO L796 eck$LassoCheckResult]: Loop: 444#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 450#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 443#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 444#L7-3 [2018-11-29 00:10:25,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,129 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-29 00:10:25,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:25,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:25,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-29 00:10:25,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-29 00:10:25,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:25,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:25,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:25,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-29 00:10:25,548 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:25,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2018-11-29 00:10:25,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,677 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:10:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:10:25,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:10:25,728 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-29 00:10:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:25,767 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-29 00:10:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:10:25,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-29 00:10:25,768 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:25,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-29 00:10:25,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:10:25,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:25,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-29 00:10:25,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:25,772 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-29 00:10:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-29 00:10:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-29 00:10:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-29 00:10:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-29 00:10:25,777 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-29 00:10:25,777 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-29 00:10:25,777 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:25,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2018-11-29 00:10:25,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-29 00:10:25,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:25,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:25,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-29 00:10:25,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:25,779 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 554#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 561#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 562#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 563#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 572#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 571#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 570#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 569#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 568#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 567#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 566#L26-3 assume !(main_~i~1 < 5); 560#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 546#L7-3 [2018-11-29 00:10:25,779 INFO L796 eck$LassoCheckResult]: Loop: 546#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 552#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 545#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 546#L7-3 [2018-11-29 00:10:25,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-29 00:10:25,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2018-11-29 00:10:25,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2018-11-29 00:10:25,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:25,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:26,540 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-29 00:10:26,682 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-29 00:10:26,703 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:26,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:26,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:26,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:26,703 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:26,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:26,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:26,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:26,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-29 00:10:26,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:26,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:26,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:26,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:27,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:27,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:27,515 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:27,515 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:27,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:27,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:27,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:27,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:27,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:27,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:27,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:27,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:27,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:27,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:27,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:27,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:27,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:27,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:27,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:27,606 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:27,606 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:10:27,606 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:27,607 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:27,607 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:27,608 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0) = -2*ULTIMATE.start_sep_~i~0 + 9 Supporting invariants [] [2018-11-29 00:10:27,694 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:27,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:27,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:27,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:27,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:27,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:27,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 46 transitions. Complement of second has 7 states. [2018-11-29 00:10:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:27,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:10:27,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:27,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-29 00:10:27,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:27,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-29 00:10:27,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:27,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2018-11-29 00:10:27,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:27,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2018-11-29 00:10:27,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:10:27,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-29 00:10:27,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-29 00:10:27,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:27,809 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-29 00:10:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-29 00:10:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-29 00:10:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-29 00:10:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-29 00:10:27,813 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-29 00:10:27,813 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-29 00:10:27,813 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:27,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-29 00:10:27,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:27,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:27,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:27,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:27,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:27,816 INFO L794 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 705#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 706#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 714#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 715#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 716#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 725#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 724#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 723#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 722#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 721#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 720#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 719#L26-3 assume !(main_~i~1 < 5); 712#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 713#L7-3 assume !(sep_~i~0 < 5); 717#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 718#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 707#L7-8 [2018-11-29 00:10:27,816 INFO L796 eck$LassoCheckResult]: Loop: 707#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 700#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 701#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 707#L7-8 [2018-11-29 00:10:27,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2018-11-29 00:10:27,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:27,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:10:27,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:27,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:27,899 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:27,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2018-11-29 00:10:27,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:27,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:27,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:27,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:27,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,051 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-29 00:10:28,162 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-29 00:10:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:28,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:28,163 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:28,191 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-29 00:10:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:28,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2018-11-29 00:10:28,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2018-11-29 00:10:28,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-29 00:10:28,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-29 00:10:28,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2018-11-29 00:10:28,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:28,196 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-29 00:10:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2018-11-29 00:10:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-29 00:10:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-29 00:10:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-29 00:10:28,201 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-29 00:10:28,201 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-29 00:10:28,201 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:10:28,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-11-29 00:10:28,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:28,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:28,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:28,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:28,203 INFO L794 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 781#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 782#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 791#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 792#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 793#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 802#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 801#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 800#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 799#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 798#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 797#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 796#L26-3 assume !(main_~i~1 < 5); 789#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 790#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 780#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 774#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 775#L7-3 assume !(sep_~i~0 < 5); 794#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 795#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 783#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 776#L9-2 [2018-11-29 00:10:28,203 INFO L796 eck$LassoCheckResult]: Loop: 776#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 777#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 786#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 776#L9-2 [2018-11-29 00:10:28,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2018-11-29 00:10:28,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:10:28,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:28,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:28,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:28,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:10:28,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:28,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-29 00:10:28,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:28,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2018-11-29 00:10:28,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:28,758 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:10:28,908 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:10:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:28,909 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-29 00:10:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:28,954 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2018-11-29 00:10:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:28,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2018-11-29 00:10:28,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 61 transitions. [2018-11-29 00:10:28,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-29 00:10:28,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-29 00:10:28,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2018-11-29 00:10:28,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:28,959 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-29 00:10:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2018-11-29 00:10:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-11-29 00:10:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-29 00:10:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-11-29 00:10:28,964 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-29 00:10:28,965 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-29 00:10:28,965 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:10:28,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2018-11-29 00:10:28,965 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:28,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:28,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:28,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:28,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:28,968 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 933#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 940#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 941#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 942#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 956#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 955#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 954#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 953#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 952#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 951#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 950#L26-3 assume !(main_~i~1 < 5); 938#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 939#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 946#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 922#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 923#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 928#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 929#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 948#L7-3 assume !(sep_~i~0 < 5); 943#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 944#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 945#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 949#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 934#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 930#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 924#L9-2 [2018-11-29 00:10:28,968 INFO L796 eck$LassoCheckResult]: Loop: 924#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 925#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 947#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 924#L9-2 [2018-11-29 00:10:28,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1248848095, now seen corresponding path program 1 times [2018-11-29 00:10:28,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:28,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-29 00:10:29,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:29,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:29,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:29,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-29 00:10:29,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:29,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-29 00:10:29,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:29,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2018-11-29 00:10:29,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:29,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:29,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:29,393 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:10:29,606 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:10:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:29,608 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-29 00:10:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:29,949 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2018-11-29 00:10:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:29,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2018-11-29 00:10:29,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:29,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 73 transitions. [2018-11-29 00:10:29,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-29 00:10:29,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-29 00:10:29,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 73 transitions. [2018-11-29 00:10:29,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:29,953 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-11-29 00:10:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 73 transitions. [2018-11-29 00:10:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-29 00:10:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-29 00:10:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-29 00:10:29,958 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-29 00:10:29,958 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-29 00:10:29,958 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:10:29,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2018-11-29 00:10:29,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:29,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:29,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:29,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:29,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:29,960 INFO L794 eck$LassoCheckResult]: Stem: 1116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1112#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1113#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1123#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1124#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1125#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1138#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1137#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1136#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1135#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1134#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1133#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1132#L26-3 assume !(main_~i~1 < 5); 1121#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1122#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1129#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1139#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1142#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1143#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1103#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1104#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1110#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1111#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1131#L7-3 assume !(sep_~i~0 < 5); 1126#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1127#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1128#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1144#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1117#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1118#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1140#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1141#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1114#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1106#L9-2 [2018-11-29 00:10:29,960 INFO L796 eck$LassoCheckResult]: Loop: 1106#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1107#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1130#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1106#L9-2 [2018-11-29 00:10:29,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1685621030, now seen corresponding path program 2 times [2018-11-29 00:10:29,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-29 00:10:30,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:30,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:30,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:30,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:30,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:30,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-29 00:10:30,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:30,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-29 00:10:30,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:30,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2018-11-29 00:10:30,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:30,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:30,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:30,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:30,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:10:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:10:30,570 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-29 00:10:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:30,818 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-29 00:10:30,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:30,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2018-11-29 00:10:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:30,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 85 transitions. [2018-11-29 00:10:30,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-29 00:10:30,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-29 00:10:30,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 85 transitions. [2018-11-29 00:10:30,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:30,823 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-11-29 00:10:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 85 transitions. [2018-11-29 00:10:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-11-29 00:10:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-29 00:10:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-11-29 00:10:30,828 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-29 00:10:30,828 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-29 00:10:30,828 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:10:30,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2018-11-29 00:10:30,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:30,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:30,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:30,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:30,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:30,833 INFO L794 eck$LassoCheckResult]: Stem: 1334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1329#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1330#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1337#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1338#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1339#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1357#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1356#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1355#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1354#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1353#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1352#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1351#L26-3 assume !(main_~i~1 < 5); 1335#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1336#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1343#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1366#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1344#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1326#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1319#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1320#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1365#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1364#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1363#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1349#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1350#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1348#L7-3 assume !(sep_~i~0 < 5); 1340#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1341#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1342#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1362#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1331#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1327#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1322#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1323#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1361#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1360#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1359#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1358#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1346#L9-2 [2018-11-29 00:10:30,833 INFO L796 eck$LassoCheckResult]: Loop: 1346#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1347#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1345#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1346#L9-2 [2018-11-29 00:10:30,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 3 times [2018-11-29 00:10:30,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:30,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:30,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:30,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:30,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-29 00:10:31,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:31,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:10:31,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-29 00:10:31,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:31,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-29 00:10:31,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:31,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-29 00:10:31,626 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:31,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 5 times [2018-11-29 00:10:31,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:31,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:31,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:31,852 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:10:31,954 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:10:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:10:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:10:31,956 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-29 00:10:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:32,047 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2018-11-29 00:10:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:10:32,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2018-11-29 00:10:32,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:32,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2018-11-29 00:10:32,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-29 00:10:32,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-29 00:10:32,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2018-11-29 00:10:32,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:32,051 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-11-29 00:10:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2018-11-29 00:10:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-11-29 00:10:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-29 00:10:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-29 00:10:32,056 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-29 00:10:32,056 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-29 00:10:32,056 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:10:32,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2018-11-29 00:10:32,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-29 00:10:32,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:32,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:32,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:32,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:32,067 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1573#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1574#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1581#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1582#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1583#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1616#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1615#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1614#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1612#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1611#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1609#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1608#L26-3 assume !(main_~i~1 < 5); 1579#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1580#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1587#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1610#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1588#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1570#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1564#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1565#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1607#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1606#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1605#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1603#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1601#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1599#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1594#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1596#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1593#L7-3 assume !(sep_~i~0 < 5); 1584#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1585#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1586#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1613#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1575#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1571#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1566#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1567#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1604#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1602#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1600#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1598#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1597#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1595#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1592#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1590#L9-2 [2018-11-29 00:10:32,067 INFO L796 eck$LassoCheckResult]: Loop: 1590#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1591#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1589#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1590#L9-2 [2018-11-29 00:10:32,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 4 times [2018-11-29 00:10:32,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:32,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:32,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 6 times [2018-11-29 00:10:32,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:32,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2018-11-29 00:10:32,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-29 00:10:32,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:32,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-29 00:10:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:10:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:10:32,791 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-29 00:10:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:33,126 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-29 00:10:33,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:10:33,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-29 00:10:33,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:33,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2018-11-29 00:10:33,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-29 00:10:33,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-29 00:10:33,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2018-11-29 00:10:33,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:33,132 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-29 00:10:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2018-11-29 00:10:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-29 00:10:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-29 00:10:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-11-29 00:10:33,138 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-29 00:10:33,138 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-29 00:10:33,138 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:10:33,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2018-11-29 00:10:33,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:33,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:33,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:33,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:33,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:33,142 INFO L794 eck$LassoCheckResult]: Stem: 1726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1721#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1722#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1729#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1730#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1731#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1764#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1763#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1762#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1761#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1760#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1759#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1758#L26-3 assume !(main_~i~1 < 5); 1727#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1728#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1719#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1713#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1714#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1757#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1755#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1753#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1751#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1749#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1747#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1745#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1743#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1741#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1739#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1737#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1735#L7-3 assume !(sep_~i~0 < 5); 1732#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1733#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1720#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1715#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1716#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1723#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1756#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1754#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1752#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1750#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1748#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1746#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1744#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1742#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1740#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1738#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1736#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1734#L7-8 assume !(sep_~i~0 < 5); 1717#L7-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1718#L14-1 main_#t~ret9 := sep_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1724#L35-3 [2018-11-29 00:10:33,142 INFO L796 eck$LassoCheckResult]: Loop: 1724#L35-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1725#L35-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1724#L35-3 [2018-11-29 00:10:33,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2018-11-29 00:10:33,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:33,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:33,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:33,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:33,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2018-11-29 00:10:33,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:33,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:33,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:33,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:33,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2018-11-29 00:10:33,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:33,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:33,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:33,771 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-29 00:10:39,023 WARN L180 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 431 DAG size of output: 308 [2018-11-29 00:10:39,027 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-29 00:10:59,339 WARN L180 SmtUtils]: Spent 12.50 s on a formula simplification. DAG size of input: 635 DAG size of output: 125 [2018-11-29 00:10:59,342 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:59,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:59,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:59,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:59,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:59,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:59,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:59,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:59,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-29 00:10:59,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:59,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:59,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,812 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-11-29 00:10:59,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:59,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:00,679 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:00,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:00,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:00,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:00,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:00,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:00,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:00,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:00,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:00,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:00,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:00,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:00,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:00,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:00,804 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-29 00:11:00,804 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-29 00:11:00,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:00,805 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:00,806 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:00,806 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2018-11-29 00:11:01,631 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2018-11-29 00:11:01,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:01,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:01,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:01,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:01,839 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:11:01,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:11:01,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 54 states and 66 transitions. Complement of second has 4 states. [2018-11-29 00:11:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-29 00:11:01,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-29 00:11:01,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:01,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2018-11-29 00:11:01,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:01,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2018-11-29 00:11:01,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:01,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2018-11-29 00:11:01,856 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:01,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2018-11-29 00:11:01,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:01,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:01,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:01,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:01,856 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:01,856 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:01,857 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:01,860 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-29 00:11:01,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:01,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:01,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:01,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:01 BoogieIcfgContainer [2018-11-29 00:11:01,869 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:01,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:01,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:01,869 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:01,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:20" (3/4) ... [2018-11-29 00:11:01,876 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:01,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:01,877 INFO L168 Benchmark]: Toolchain (without parser) took 42660.90 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 773.8 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 568.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:01,878 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:01,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:01,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.38 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:01,880 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:01,881 INFO L168 Benchmark]: RCFGBuilder took 688.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:01,883 INFO L168 Benchmark]: BuchiAutomizer took 41519.51 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 638.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 585.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:01,884 INFO L168 Benchmark]: Witness Printer took 7.17 ms. Allocated memory is still 1.8 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:01,890 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.38 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 688.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41519.51 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 638.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 585.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.17 ms. Allocated memory is still 1.8 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.4s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 39.1s. Construction of modules took 1.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 329 SDtfs, 341 SDslu, 668 SDs, 0 SdLazy, 321 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital245 mio100 ax100 hnf99 lsp92 ukn50 mio100 lsp57 div100 bol100 ite100 ukn100 eq167 hnf87 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...