./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:48:28,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:48:28,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:48:28,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:48:28,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:48:28,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:48:28,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:48:28,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:48:28,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:48:28,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:48:28,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:48:28,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:48:28,456 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:48:28,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:48:28,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:48:28,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:48:28,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:48:28,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:48:28,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:48:28,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:48:28,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:48:28,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:48:28,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:48:28,473 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:48:28,473 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:48:28,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:48:28,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:48:28,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:48:28,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:48:28,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:48:28,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:48:28,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:48:28,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:48:28,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:48:28,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:48:28,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:48:28,482 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:48:28,516 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:48:28,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:48:28,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:48:28,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:48:28,522 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:48:28,522 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:48:28,522 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:48:28,522 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:48:28,522 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:48:28,523 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:48:28,523 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:48:28,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:48:28,523 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:48:28,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:48:28,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:48:28,527 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:48:28,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:48:28,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:48:28,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:48:28,528 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:48:28,528 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:48:28,528 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:48:28,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:48:28,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:48:28,528 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:48:28,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:48:28,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:48:28,529 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:48:28,534 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:48:28,535 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2019-01-01 21:48:28,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:48:28,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:48:28,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:48:28,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:48:28,630 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:48:28,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:28,701 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682acc47b/d56e6585fa5144448f9d5369bab1349c/FLAG737beb484 [2019-01-01 21:48:29,251 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:48:29,252 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:29,272 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682acc47b/d56e6585fa5144448f9d5369bab1349c/FLAG737beb484 [2019-01-01 21:48:29,501 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682acc47b/d56e6585fa5144448f9d5369bab1349c [2019-01-01 21:48:29,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:48:29,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:48:29,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:29,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:48:29,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:48:29,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:29" (1/1) ... [2019-01-01 21:48:29,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e770281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:29, skipping insertion in model container [2019-01-01 21:48:29,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:29" (1/1) ... [2019-01-01 21:48:29,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:48:29,576 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:48:30,015 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:30,031 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:48:30,158 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:30,210 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:48:30,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30 WrapperNode [2019-01-01 21:48:30,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:30,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:30,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:48:30,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:48:30,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:30,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:48:30,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:48:30,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:48:30,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (1/1) ... [2019-01-01 21:48:30,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:48:30,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:48:30,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:48:30,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:48:30,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (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 [2019-01-01 21:48:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:48:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:48:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:48:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:48:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:48:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:48:30,821 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:48:30,821 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:48:30,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:30 BoogieIcfgContainer [2019-01-01 21:48:30,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:48:30,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:48:30,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:48:30,827 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:48:30,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:30,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:48:29" (1/3) ... [2019-01-01 21:48:30,830 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17525b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:30, skipping insertion in model container [2019-01-01 21:48:30,830 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:30,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:30" (2/3) ... [2019-01-01 21:48:30,830 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17525b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:30, skipping insertion in model container [2019-01-01 21:48:30,831 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:30,831 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:30" (3/3) ... [2019-01-01 21:48:30,833 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:30,894 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:48:30,895 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:48:30,895 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:48:30,895 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:48:30,896 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:48:30,896 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:48:30,896 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:48:30,896 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:48:30,896 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:48:30,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:48:30,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:30,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:30,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:30,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:30,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:30,941 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:48:30,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:48:30,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:30,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:30,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:30,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:30,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:30,953 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L553-3true [2019-01-01 21:48:30,954 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2019-01-01 21:48:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:30,966 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:48:30,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:30,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2019-01-01 21:48:31,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:31,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:31,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:48:31,182 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:48:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:48:31,203 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-01 21:48:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:31,211 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-01 21:48:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:48:31,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-01 21:48:31,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:31,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2019-01-01 21:48:31,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:48:31,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:48:31,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-01 21:48:31,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:31,222 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:48:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-01 21:48:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-01 21:48:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:48:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-01 21:48:31,255 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:48:31,255 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:48:31,256 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:48:31,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-01-01 21:48:31,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:31,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:31,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:31,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:31,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:48:31,259 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 37#L553-3 [2019-01-01 21:48:31,259 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2019-01-01 21:48:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:48:31,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:31,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2019-01-01 21:48:31,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:31,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:31,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:31,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:48:31,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:31,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:48:31,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:48:31,480 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-01-01 21:48:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:31,791 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-01 21:48:31,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:48:31,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-01-01 21:48:31,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-01 21:48:31,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2019-01-01 21:48:31,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 21:48:31,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:48:31,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-01-01 21:48:31,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:31,796 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-01 21:48:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-01-01 21:48:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-01 21:48:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:48:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-01-01 21:48:31,803 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:48:31,803 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:48:31,803 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:48:31,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-01-01 21:48:31,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:48:31,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:31,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:31,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:31,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:48:31,806 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 73#L553-3 [2019-01-01 21:48:31,807 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2019-01-01 21:48:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-01 21:48:31,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2019-01-01 21:48:31,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,883 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2019-01-01 21:48:31,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:31,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:32,190 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-01 21:48:32,425 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:48:32,924 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-01 21:48:33,192 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 21:48:33,207 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:33,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:33,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:33,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:33,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:33,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:33,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:33,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:33,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-01 21:48:33,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:33,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:33,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,627 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-01-01 21:48:33,827 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-01-01 21:48:33,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:34,481 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:48:34,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:34,530 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:34,533 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 [2019-01-01 21:48:34,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,541 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 [2019-01-01 21:48:34,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,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 [2019-01-01 21:48:34,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,548 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 [2019-01-01 21:48:34,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,551 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 [2019-01-01 21:48:34,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,553 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 [2019-01-01 21:48:34,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,576 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 [2019-01-01 21:48:34,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,585 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 [2019-01-01 21:48:34,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,591 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 [2019-01-01 21:48:34,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,603 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 [2019-01-01 21:48:34,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,609 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 [2019-01-01 21:48:34,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,618 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 [2019-01-01 21:48:34,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,624 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 [2019-01-01 21:48:34,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:34,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:34,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,630 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 [2019-01-01 21:48:34,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,655 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 [2019-01-01 21:48:34,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,692 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 [2019-01-01 21:48:34,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,720 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 [2019-01-01 21:48:34,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:34,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 [2019-01-01 21:48:34,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:34,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:34,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:34,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:34,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:34,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:34,748 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:34,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:48:34,758 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:48:34,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:34,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:34,763 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:34,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2019-01-01 21:48:34,862 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:48:34,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:34,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:34,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:35,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 21:48:35,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:48:35,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:35,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-01-01 21:48:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:35,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:48:35,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 21:48:35,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2019-01-01 21:48:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:48:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:48:35,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:48:35,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:35,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:48:35,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:35,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-01 21:48:35,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:35,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-01-01 21:48:35,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:48:35,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2019-01-01 21:48:35,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:48:35,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:48:35,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-01 21:48:35,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:35,505 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-01 21:48:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-01 21:48:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-01 21:48:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 21:48:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-01 21:48:35,510 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-01 21:48:35,510 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-01 21:48:35,510 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:48:35,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-01 21:48:35,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:48:35,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:35,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:35,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:48:35,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:35,514 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-01-01 21:48:35,514 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-01-01 21:48:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:48:35,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:35,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:35,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:35,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:35,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2019-01-01 21:48:35,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:35,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:35,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:48:35,693 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 [2019-01-01 21:48:35,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:35,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:35,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 21:48:35,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:48:35,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-01 21:48:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:35,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-01 21:48:35,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:35,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-01 21:48:35,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:35,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-01-01 21:48:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:35,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:48:35,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-01 21:48:35,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:48:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:48:35,883 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-01-01 21:48:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:36,034 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-01-01 21:48:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:48:36,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2019-01-01 21:48:36,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-01-01 21:48:36,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2019-01-01 21:48:36,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:48:36,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:48:36,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2019-01-01 21:48:36,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:36,040 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-01-01 21:48:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2019-01-01 21:48:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-01-01 21:48:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 21:48:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-01-01 21:48:36,045 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-01 21:48:36,045 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-01 21:48:36,045 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:48:36,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-01-01 21:48:36,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 21:48:36,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:36,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:36,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:48:36,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:36,047 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-01-01 21:48:36,047 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-01-01 21:48:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-01 21:48:36,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:36,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2019-01-01 21:48:36,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:36,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:36,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2019-01-01 21:48:36,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:36,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:36,751 WARN L181 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-01-01 21:48:37,099 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-01-01 21:48:37,209 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-01 21:48:37,212 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:37,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:37,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:37,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:37,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:37,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:37,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:37,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:37,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-01 21:48:37,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:37,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:37,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:37,527 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-01-01 21:48:38,107 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:48:38,271 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:48:38,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:38,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:38,291 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 [2019-01-01 21:48:38,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,299 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 [2019-01-01 21:48:38,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,305 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 [2019-01-01 21:48:38,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,313 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 [2019-01-01 21:48:38,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,319 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 [2019-01-01 21:48:38,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,325 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 [2019-01-01 21:48:38,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,331 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 [2019-01-01 21:48:38,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,339 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 [2019-01-01 21:48:38,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,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 [2019-01-01 21:48:38,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,353 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 [2019-01-01 21:48:38,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,359 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 [2019-01-01 21:48:38,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,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 [2019-01-01 21:48:38,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,374 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 [2019-01-01 21:48:38,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,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 [2019-01-01 21:48:38,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,386 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 [2019-01-01 21:48:38,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,393 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 [2019-01-01 21:48:38,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,401 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 [2019-01-01 21:48:38,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,409 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 [2019-01-01 21:48:38,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:38,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:38,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:38,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,412 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 [2019-01-01 21:48:38,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,435 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 [2019-01-01 21:48:38,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,446 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 [2019-01-01 21:48:38,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,459 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 [2019-01-01 21:48:38,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:38,470 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 [2019-01-01 21:48:38,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:38,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:38,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:38,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:38,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:38,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:38,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:38,500 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:48:38,500 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:48:38,501 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:38,503 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:38,503 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:38,503 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2019-01-01 21:48:38,784 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:48:38,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:38,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:38,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:39,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2019-01-01 21:48:39,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2019-01-01 21:48:39,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2019-01-01 21:48:39,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:30 [2019-01-01 21:48:39,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,544 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-01-01 21:48:39,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2019-01-01 21:48:39,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2019-01-01 21:48:39,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-01-01 21:48:39,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:52, output treesize:56 [2019-01-01 21:48:40,161 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-01 21:48:40,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:40,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2019-01-01 21:48:40,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:40,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-01 21:48:40,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:40,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:40,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:40,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2019-01-01 21:48:40,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:48:40,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:40,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-01 21:48:40,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:40,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:40,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 21:48:40,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:60 [2019-01-01 21:48:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:40,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-01 21:48:40,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2019-01-01 21:48:41,091 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-01-01 21:48:41,342 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2019-01-01 21:48:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:48:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2019-01-01 21:48:41,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-01 21:48:41,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:41,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2019-01-01 21:48:41,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:41,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2019-01-01 21:48:41,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:41,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2019-01-01 21:48:41,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-01-01 21:48:41,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2019-01-01 21:48:41,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-01 21:48:41,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-01 21:48:41,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2019-01-01 21:48:41,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:41,355 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2019-01-01 21:48:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2019-01-01 21:48:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-01-01 21:48:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 21:48:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2019-01-01 21:48:41,365 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-01-01 21:48:41,365 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-01-01 21:48:41,365 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:48:41,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2019-01-01 21:48:41,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-01-01 21:48:41,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:41,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:41,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:41,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 21:48:41,371 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-01-01 21:48:41,372 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-01-01 21:48:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:48:41,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:41,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2019-01-01 21:48:41,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:41,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2019-01-01 21:48:41,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:41,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:41,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:41,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:41,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:42,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:48:42,234 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 [2019-01-01 21:48:42,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:42,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:42,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 21:48:42,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:48:42,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-01 21:48:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:42,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-01 21:48:42,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:42,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-01 21:48:42,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-01-01 21:48:42,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:42,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-01 21:48:42,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:42,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-01 21:48:42,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:42,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-01-01 21:48:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:42,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:48:42,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-01 21:48:42,986 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2019-01-01 21:48:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:48:43,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:48:43,040 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2019-01-01 21:48:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:43,208 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2019-01-01 21:48:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:48:43,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2019-01-01 21:48:43,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-01 21:48:43,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2019-01-01 21:48:43,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2019-01-01 21:48:43,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-01-01 21:48:43,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2019-01-01 21:48:43,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:43,217 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2019-01-01 21:48:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2019-01-01 21:48:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2019-01-01 21:48:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 21:48:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-01-01 21:48:43,230 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-01 21:48:43,230 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-01 21:48:43,230 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:48:43,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2019-01-01 21:48:43,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-01-01 21:48:43,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:43,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:43,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:48:43,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:48:43,233 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-01-01 21:48:43,234 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-01-01 21:48:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-01-01 21:48:43,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:43,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:43,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2019-01-01 21:48:43,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:43,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:43,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2019-01-01 21:48:43,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:43,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:43,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:43,973 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2019-01-01 21:48:44,263 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-01-01 21:48:44,348 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:44,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:44,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:44,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:44,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:44,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:44,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:44,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:44,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2019-01-01 21:48:44,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:44,350 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:44,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:44,765 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-01 21:48:44,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:45,498 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:48:45,687 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 21:48:45,811 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:48:45,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:45,860 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:45,860 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 [2019-01-01 21:48:45,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,868 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 [2019-01-01 21:48:45,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,871 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 [2019-01-01 21:48:45,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,876 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 [2019-01-01 21:48:45,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,881 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 [2019-01-01 21:48:45,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,886 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 [2019-01-01 21:48:45,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,895 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 [2019-01-01 21:48:45,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,907 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 [2019-01-01 21:48:45,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,913 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 [2019-01-01 21:48:45,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,917 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 [2019-01-01 21:48:45,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,926 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 [2019-01-01 21:48:45,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,928 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 [2019-01-01 21:48:45,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,936 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 [2019-01-01 21:48:45,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,938 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 [2019-01-01 21:48:45,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,941 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 [2019-01-01 21:48:45,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,945 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 [2019-01-01 21:48:45,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,950 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 [2019-01-01 21:48:45,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,953 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 [2019-01-01 21:48:45,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:45,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:45,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:45,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,957 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 [2019-01-01 21:48:45,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:45,964 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 [2019-01-01 21:48:45,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:45,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:45,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:45,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:45,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:45,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:45,987 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:46,013 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:48:46,013 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:48:46,014 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:46,014 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:46,016 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:46,016 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-01-01 21:48:46,304 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:48:46,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:46,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:46,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:46,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2019-01-01 21:48:46,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2019-01-01 21:48:46,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:46,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-01 21:48:46,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:46,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:48:46,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:48:46,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2019-01-01 21:48:46,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-01 21:48:46,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-01-01 21:48:46,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:46,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:46,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 21:48:46,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:46,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 21:48:46,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:47,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:47,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:48:47,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-01 21:48:47,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:47,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-01 21:48:47,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:47,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-01 21:48:47,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:47,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:47,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:47,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2019-01-01 21:48:47,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:47,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-01 21:48:47,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:47,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:47,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:48:47,409 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-01 21:48:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:47,461 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:48:47,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-01-01 21:48:47,980 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-01-01 21:48:48,163 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-01-01 21:48:48,414 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-01 21:48:49,760 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2019-01-01 21:48:51,622 WARN L181 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-01-01 21:48:51,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2019-01-01 21:48:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:48:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-01-01 21:48:51,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2019-01-01 21:48:51,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:51,770 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:48:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:51,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:51,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:51,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:51,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2019-01-01 21:48:51,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:51,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-01 21:48:51,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:52,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-01 21:48:52,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:48:52,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:48:52,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:48:52,140 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2019-01-01 21:48:52,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-01 21:48:52,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-01-01 21:48:52,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 21:48:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-01 21:48:52,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:48:52,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-01 21:48:52,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-01 21:48:52,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-01 21:48:52,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2019-01-01 21:48:52,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:52,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-01 21:48:52,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:52,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 21:48:52,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-01 21:48:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:52,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:48:52,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-01-01 21:48:53,914 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-01-01 21:48:54,594 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 26 [2019-01-01 21:48:55,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 353 states and 447 transitions. Complement of second has 29 states. [2019-01-01 21:48:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:48:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2019-01-01 21:48:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 14 letters. [2019-01-01 21:48:55,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:55,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 18 letters. Loop has 14 letters. [2019-01-01 21:48:55,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:55,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 28 letters. [2019-01-01 21:48:55,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:55,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 447 transitions. [2019-01-01 21:48:55,166 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-01-01 21:48:55,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 286 states and 366 transitions. [2019-01-01 21:48:55,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-01 21:48:55,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-01 21:48:55,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 366 transitions. [2019-01-01 21:48:55,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:55,179 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 366 transitions. [2019-01-01 21:48:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 366 transitions. [2019-01-01 21:48:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 233. [2019-01-01 21:48:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-01 21:48:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2019-01-01 21:48:55,206 INFO L728 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-01-01 21:48:55,206 INFO L608 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-01-01 21:48:55,206 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:48:55,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2019-01-01 21:48:55,209 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-01 21:48:55,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:55,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:55,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:55,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:55,210 INFO L794 eck$LassoCheckResult]: Stem: 1944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1942#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1943#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1945#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1946#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2019-01-01 21:48:55,210 INFO L796 eck$LassoCheckResult]: Loop: 1959#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1950#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1951#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1954#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2019-01-01 21:48:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-01 21:48:55,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:55,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:55,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:55,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:55,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2019-01-01 21:48:55,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:55,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:55,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2019-01-01 21:48:55,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:55,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:55,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:55,720 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-01 21:48:55,842 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:48:56,173 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-01-01 21:48:56,799 WARN L181 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2019-01-01 21:48:56,803 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:56,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:56,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:56,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:56,803 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:56,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:56,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:56,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:56,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2019-01-01 21:48:56,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:56,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:56,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:57,479 WARN L181 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-01-01 21:48:57,621 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-01 21:48:57,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:57,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:57,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:57,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:57,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:57,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:58,144 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:48:58,406 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 21:48:58,578 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-01 21:48:58,619 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:58,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:58,620 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 [2019-01-01 21:48:58,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:58,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:58,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:58,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,633 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 [2019-01-01 21:48:58,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:58,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,637 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 [2019-01-01 21:48:58,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:58,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:58,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:58,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,639 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 [2019-01-01 21:48:58,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:58,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:58,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:58,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,641 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 [2019-01-01 21:48:58,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:58,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,646 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 [2019-01-01 21:48:58,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:58,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:58,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:58,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,648 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 [2019-01-01 21:48:58,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:58,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:58,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:58,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,650 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 [2019-01-01 21:48:58,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:58,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,657 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 [2019-01-01 21:48:58,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:58,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:58,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:58,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,659 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 [2019-01-01 21:48:58,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,662 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:48:58,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,663 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:48:58,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,672 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 [2019-01-01 21:48:58,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:58,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,690 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 [2019-01-01 21:48:58,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:58,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,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 [2019-01-01 21:48:58,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:58,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:58,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:58,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:58,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:58,704 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 [2019-01-01 21:48:58,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:58,709 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:48:58,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:48:58,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:58,729 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:48:58,729 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:48:58,936 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:59,078 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:48:59,078 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:48:59,079 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:59,082 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:48:59,084 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:59,084 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2019-01-01 21:48:59,382 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:48:59,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:59,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:59,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:59,973 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-01 21:48:59,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:59,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 21:49:00,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:00,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-01 21:49:00,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:00,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:00,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:00,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-01 21:49:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:00,047 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:49:00,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2019-01-01 21:49:00,111 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2019-01-01 21:49:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:49:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-01 21:49:00,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:49:00,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:00,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:49:00,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:00,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 21:49:00,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:00,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2019-01-01 21:49:00,123 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-01 21:49:00,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2019-01-01 21:49:00,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-01 21:49:00,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-01-01 21:49:00,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2019-01-01 21:49:00,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:00,160 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2019-01-01 21:49:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2019-01-01 21:49:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2019-01-01 21:49:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-01 21:49:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2019-01-01 21:49:00,184 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-01-01 21:49:00,184 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-01-01 21:49:00,184 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:49:00,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2019-01-01 21:49:00,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-01 21:49:00,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:00,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:00,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:00,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:00,193 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2647#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2648#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2664#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2835#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2796#L555-1 assume !test_fun_#t~short8; 2725#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2678#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2675#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2019-01-01 21:49:00,193 INFO L796 eck$LassoCheckResult]: Loop: 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2724#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2714#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2650#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2651#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2696#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2681#L555-1 assume !test_fun_#t~short8; 2683#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2667#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2668#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2019-01-01 21:49:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2019-01-01 21:49:00,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:00,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:00,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2019-01-01 21:49:00,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:00,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:00,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2019-01-01 21:49:00,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:00,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:00,596 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-01 21:49:00,803 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-01 21:49:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:49:00,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:49:00,866 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 [2019-01-01 21:49:00,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:49:00,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 21:49:00,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:49:00,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:00,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 21:49:00,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:00,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:00,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-01-01 21:49:00,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 21:49:00,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:49:00,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:00,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:00,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:00,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-01 21:49:01,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:01,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-01-01 21:49:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:01,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-01-01 21:49:01,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:01,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:01,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:01,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-01-01 21:49:01,077 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:01,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-01 21:49:01,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-01 21:49:01,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:01,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:01,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:01,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-01-01 21:49:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:49:01,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:49:01,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-01-01 21:49:01,351 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-01-01 21:49:01,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:49:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:49:01,408 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 12 states. [2019-01-01 21:49:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:01,557 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2019-01-01 21:49:01,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:49:01,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2019-01-01 21:49:01,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-01-01 21:49:01,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2019-01-01 21:49:01,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-01 21:49:01,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-01 21:49:01,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2019-01-01 21:49:01,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:01,564 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2019-01-01 21:49:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2019-01-01 21:49:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-01-01 21:49:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-01 21:49:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-01-01 21:49:01,573 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-01 21:49:01,573 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-01 21:49:01,574 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:49:01,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2019-01-01 21:49:01,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-01 21:49:01,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:01,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:01,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:01,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:49:01,581 INFO L794 eck$LassoCheckResult]: Stem: 3303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3301#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3302#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3346#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3345#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3340#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3341#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3336#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3337#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3333#L555-1 assume !test_fun_#t~short8; 3332#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3331#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3329#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3318#L553-1 [2019-01-01 21:49:01,581 INFO L796 eck$LassoCheckResult]: Loop: 3318#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3397#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3393#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3392#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3391#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3390#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3388#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3384#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3385#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3376#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3377#L555-1 assume !test_fun_#t~short8; 3327#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3328#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3317#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3318#L553-1 [2019-01-01 21:49:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2019-01-01 21:49:01,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:01,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:01,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:01,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2019-01-01 21:49:01,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:01,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:01,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2019-01-01 21:49:01,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:01,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:01,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:01,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 21:49:02,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:49:02,027 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 [2019-01-01 21:49:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:49:02,070 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-01-01 21:49:02,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:49:02,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:02,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 21:49:02,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:49:02,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-01 21:49:02,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2019-01-01 21:49:02,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-01-01 21:49:02,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-01-01 21:49:02,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:02,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:02,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-01-01 21:49:02,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2019-01-01 21:49:02,527 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:02,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-01 21:49:02,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2019-01-01 21:49:02,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 21:49:02,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:02,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:47 [2019-01-01 21:49:02,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2019-01-01 21:49:02,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2019-01-01 21:49:02,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:02,753 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:49:02,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2019-01-01 21:49:02,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:02,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:02,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:49:02,801 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:49 [2019-01-01 21:49:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 21:49:02,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:49:02,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-01-01 21:49:03,292 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2019-01-01 21:49:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 21:49:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:49:03,335 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2019-01-01 21:49:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:03,871 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-01-01 21:49:03,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:49:03,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2019-01-01 21:49:03,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:03,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2019-01-01 21:49:03,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 21:49:03,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 21:49:03,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2019-01-01 21:49:03,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:03,877 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-01-01 21:49:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2019-01-01 21:49:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-01-01 21:49:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 21:49:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-01-01 21:49:03,882 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-01-01 21:49:03,882 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-01-01 21:49:03,882 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:49:03,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2019-01-01 21:49:03,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:03,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:03,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:03,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:49:03,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:49:03,888 INFO L794 eck$LassoCheckResult]: Stem: 3661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3659#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3660#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3666#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3667#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3697#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3696#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3695#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3694#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3693#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3692#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3691#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3690#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3679#L555-1 assume !test_fun_#t~short8; 3677#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3676#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3673#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3668#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3669#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3674#L555-1 [2019-01-01 21:49:03,888 INFO L796 eck$LassoCheckResult]: Loop: 3674#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3663#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3670#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3674#L555-1 [2019-01-01 21:49:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2019-01-01 21:49:03,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:03,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:03,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2019-01-01 21:49:03,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:03,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2019-01-01 21:49:03,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:03,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:03,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:03,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:04,198 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-01 21:49:04,302 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:49:06,310 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 201 DAG size of output: 153 [2019-01-01 21:49:06,460 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-01 21:49:06,464 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:06,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:06,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:06,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:06,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:06,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:06,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:06,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:06,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2019-01-01 21:49:06,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:06,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:06,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,723 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-01 21:49:06,902 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-01 21:49:06,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:06,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:07,085 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:49:07,616 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:49:07,825 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-01 21:49:07,927 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:07,927 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:07,928 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 [2019-01-01 21:49:07,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,937 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 [2019-01-01 21:49:07,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:07,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:07,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,940 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 [2019-01-01 21:49:07,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:07,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:07,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,942 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 [2019-01-01 21:49:07,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,944 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 [2019-01-01 21:49:07,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,947 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 [2019-01-01 21:49:07,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:07,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:07,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,950 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 [2019-01-01 21:49:07,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,952 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 [2019-01-01 21:49:07,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,953 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 [2019-01-01 21:49:07,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,956 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 [2019-01-01 21:49:07,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:07,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:07,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:07,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,959 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 [2019-01-01 21:49:07,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,959 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:49:07,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:07,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,962 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:49:07,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:07,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:07,969 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 [2019-01-01 21:49:07,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:07,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:07,970 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:49:07,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:07,978 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:49:07,978 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:49:08,156 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:08,272 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:49:08,272 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:49:08,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:08,283 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:49:08,283 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:08,283 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2019-01-01 21:49:08,552 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:49:08,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:49:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:08,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:09,299 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-01 21:49:09,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:09,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 21:49:09,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:09,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-01 21:49:09,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-01 21:49:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:09,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:49:09,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:49:09,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2019-01-01 21:49:09,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:49:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 21:49:09,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-01 21:49:09,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:09,593 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:49:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:09,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:09,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:09,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:09,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 21:49:09,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:09,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-01 21:49:09,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-01 21:49:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:09,747 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:49:09,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:49:09,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2019-01-01 21:49:09,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:49:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-01 21:49:09,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-01 21:49:09,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:09,816 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:49:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:09,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:09,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:09,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 21:49:09,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:49:09,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-01 21:49:09,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:09,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-01 21:49:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:09,949 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:49:09,949 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:49:10,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2019-01-01 21:49:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:49:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 21:49:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-01 21:49:10,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2019-01-01 21:49:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:10,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2019-01-01 21:49:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:10,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2019-01-01 21:49:10,086 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:10,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-01-01 21:49:10,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:10,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:10,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:10,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:10,087 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:10,087 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:10,087 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:10,087 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:49:10,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:10,087 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:10,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:10,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:10 BoogieIcfgContainer [2019-01-01 21:49:10,099 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:10,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:10,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:10,100 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:10,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:30" (3/4) ... [2019-01-01 21:49:10,104 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:10,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:10,106 INFO L168 Benchmark]: Toolchain (without parser) took 40600.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.2 MB). Free memory was 952.7 MB in the beginning and 997.9 MB in the end (delta: -45.3 MB). Peak memory consumption was 379.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:10,106 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-01 21:49:10,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:10,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:10,108 INFO L168 Benchmark]: Boogie Preprocessor took 29.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:10,108 INFO L168 Benchmark]: RCFGBuilder took 524.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:10,108 INFO L168 Benchmark]: BuchiAutomizer took 39275.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.1 MB). Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 88.8 MB). Peak memory consumption was 381.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:10,108 INFO L168 Benchmark]: Witness Printer took 5.42 ms. Allocated memory is still 1.5 GB. Free memory is still 997.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:10,114 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.15 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 702.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 524.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39275.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.1 MB). Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 88.8 MB). Peak memory consumption was 381.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.42 ms. Allocated memory is still 1.5 GB. Free memory is still 997.9 MB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.2s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 23.2s. Construction of modules took 2.1s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 182 SDslu, 81 SDs, 0 SdLazy, 763 SolverSat, 166 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax105 hnf99 lsp83 ukn57 mio100 lsp33 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf211 smp79 tf100 neg95 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 379ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...