./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/b.14-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 14310793a2daa3bf62d53b5cef67b6406903d242 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:31:03,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:31:03,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:31:03,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:31:03,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:31:03,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:31:03,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:31:03,296 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:31:03,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:31:03,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:31:03,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:31:03,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:31:03,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:31:03,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:31:03,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:31:03,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:31:03,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:31:03,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:31:03,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:31:03,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:31:03,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:31:03,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:31:03,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:31:03,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:31:03,328 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:31:03,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:31:03,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:31:03,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:31:03,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:31:03,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:31:03,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:31:03,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:31:03,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:31:03,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:31:03,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:31:03,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:31:03,338 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:31:03,370 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:31:03,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:31:03,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:31:03,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:31:03,373 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:31:03,374 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:31:03,374 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:31:03,375 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:31:03,375 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:31:03,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:31:03,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:31:03,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:31:03,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:31:03,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:31:03,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:31:03,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:31:03,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:31:03,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:31:03,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:31:03,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:31:03,378 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:31:03,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:31:03,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:31:03,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:31:03,378 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:31:03,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:31:03,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:31:03,381 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:31:03,382 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:31:03,383 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 -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2019-01-14 02:31:03,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:31:03,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:31:03,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:31:03,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:31:03,471 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:31:03,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:03,546 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb8686a2/c6bb9e38c5b9457a969bc67441b8ed44/FLAG21e17f077 [2019-01-14 02:31:04,057 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:31:04,061 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:04,082 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb8686a2/c6bb9e38c5b9457a969bc67441b8ed44/FLAG21e17f077 [2019-01-14 02:31:04,370 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb8686a2/c6bb9e38c5b9457a969bc67441b8ed44 [2019-01-14 02:31:04,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:31:04,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:31:04,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:31:04,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:31:04,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:31:04,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:31:04" (1/1) ... [2019-01-14 02:31:04,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4030460c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:04, skipping insertion in model container [2019-01-14 02:31:04,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:31:04" (1/1) ... [2019-01-14 02:31:04,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:31:04,447 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:31:04,866 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:31:04,889 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:31:05,053 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:31:05,120 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:31:05,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05 WrapperNode [2019-01-14 02:31:05,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:31:05,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:31:05,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:31:05,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:31:05,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:31:05,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:31:05,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:31:05,201 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:31:05,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (1/1) ... [2019-01-14 02:31:05,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:31:05,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:31:05,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:31:05,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:31:05,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (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-14 02:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:31:05,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:31:05,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:31:05,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:31:05,710 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:31:05,711 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:31:05,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:05 BoogieIcfgContainer [2019-01-14 02:31:05,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:31:05,713 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:31:05,713 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:31:05,717 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:31:05,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:05,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:31:04" (1/3) ... [2019-01-14 02:31:05,720 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e8cdcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:31:05, skipping insertion in model container [2019-01-14 02:31:05,720 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:05,720 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:05" (2/3) ... [2019-01-14 02:31:05,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e8cdcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:31:05, skipping insertion in model container [2019-01-14 02:31:05,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:05,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:05" (3/3) ... [2019-01-14 02:31:05,723 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.14-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:05,790 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:31:05,791 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:31:05,791 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:31:05,791 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:31:05,792 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:31:05,792 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:31:05,792 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:31:05,792 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:31:05,793 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:31:05,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:31:05,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:31:05,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:05,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:05,852 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:05,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:05,853 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:31:05,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:31:05,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:31:05,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:05,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:05,857 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:05,857 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:05,866 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L556-4true [2019-01-14 02:31:05,867 INFO L796 eck$LassoCheckResult]: Loop: 6#L556-4true 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; 14#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 7#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 4#L556-3true assume !true; 6#L556-4true [2019-01-14 02:31:05,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:31:05,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2019-01-14 02:31:06,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:06,126 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-14 02:31:06,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:31:06,134 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:31:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:31:06,154 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-14 02:31:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:06,165 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-14 02:31:06,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:31:06,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-14 02:31:06,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:31:06,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2019-01-14 02:31:06,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:31:06,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:31:06,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-01-14 02:31:06,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:06,180 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:31:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-01-14 02:31:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:31:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:31:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:31:06,215 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:31:06,216 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:31:06,216 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:31:06,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:31:06,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:31:06,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:06,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:06,218 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:06,219 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:06,219 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L556-4 [2019-01-14 02:31:06,219 INFO L796 eck$LassoCheckResult]: Loop: 33#L556-4 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; 37#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 38#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 34#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 33#L556-4 [2019-01-14 02:31:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:31:06,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,274 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2019-01-14 02:31:06,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:06,479 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-14 02:31:06,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:31:06,480 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:31:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:31:06,481 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-01-14 02:31:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:06,778 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-14 02:31:06,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:31:06,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:31:06,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:06,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-01-14 02:31:06,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:31:06,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:31:06,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 02:31:06,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:06,783 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:31:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 02:31:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 02:31:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:31:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-14 02:31:06,785 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:31:06,785 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:31:06,785 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:31:06,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-01-14 02:31:06,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:06,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:06,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:06,787 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:06,787 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:31:06,787 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 64#L556-4 [2019-01-14 02:31:06,787 INFO L796 eck$LassoCheckResult]: Loop: 64#L556-4 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; 68#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 69#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 65#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 66#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 70#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 71#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 64#L556-4 [2019-01-14 02:31:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 02:31:06,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2019-01-14 02:31:06,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2019-01-14 02:31:06,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:07,613 WARN L181 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-14 02:31:08,295 WARN L181 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-01-14 02:31:08,472 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-14 02:31:08,485 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:08,486 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:08,486 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:08,486 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:08,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:08,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:08,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:08,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:08,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-14 02:31:08,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:08,487 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:08,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-14 02:31:08,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-14 02:31:08,526 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-14 02:31:08,534 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-14 02:31:08,540 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-14 02:31:08,543 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-14 02:31:08,561 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-14 02:31:08,572 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-14 02:31:08,586 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-14 02:31:08,591 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-14 02:31:08,597 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-14 02:31:08,602 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-14 02:31:08,606 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-14 02:31:08,613 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-14 02:31:09,098 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-14 02:31:09,290 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-14 02:31:09,290 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-14 02:31:09,293 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-14 02:31:09,294 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-14 02:31:09,316 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-14 02:31:10,696 WARN L181 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:31:10,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:10,775 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:10,777 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-14 02:31:10,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,784 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-14 02:31:10,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,787 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-14 02:31:10,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,791 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-14 02:31:10,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,794 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-14 02:31:10,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,802 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-14 02:31:10,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:10,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:10,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,814 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-14 02:31:10,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,828 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-14 02:31:10,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,838 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-14 02:31:10,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,846 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-14 02:31:10,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:10,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:10,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,865 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-14 02:31:10,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,874 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-14 02:31:10,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:10,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:10,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,890 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-14 02:31:10,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:10,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:10,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:10,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:10,899 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-14 02:31:10,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:10,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:10,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:10,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:10,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:10,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:10,943 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:10,960 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:10,960 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:10,963 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:10,964 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:10,965 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:10,965 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-14 02:31:11,195 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:31:11,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:11,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:11,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:11,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2019-01-14 02:31:11,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,600 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 68 treesize of output 63 [2019-01-14 02:31:11,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,613 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 68 treesize of output 63 [2019-01-14 02:31:11,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,622 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:31:11,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2019-01-14 02:31:11,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,669 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-14 02:31:11,670 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,828 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 45 [2019-01-14 02:31:11,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,837 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 23 treesize of output 16 [2019-01-14 02:31:11,838 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:11,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:11,890 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2019-01-14 02:31:12,313 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-14 02:31:12,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:12,318 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 80 treesize of output 79 [2019-01-14 02:31:12,319 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:12,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:12,324 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 80 treesize of output 79 [2019-01-14 02:31:12,326 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:12,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:12,331 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 80 treesize of output 79 [2019-01-14 02:31:12,333 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:12,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:12,901 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 71 treesize of output 74 [2019-01-14 02:31:12,903 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2019-01-14 02:31:13,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,361 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 35 treesize of output 36 [2019-01-14 02:31:13,362 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,402 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 34 treesize of output 43 [2019-01-14 02:31:13,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,406 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 23 treesize of output 16 [2019-01-14 02:31:13,406 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,414 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,421 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 81 [2019-01-14 02:31:13,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,745 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 72 treesize of output 65 [2019-01-14 02:31:13,746 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,828 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 49 treesize of output 56 [2019-01-14 02:31:13,829 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 46 treesize of output 55 [2019-01-14 02:31:13,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,903 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 23 treesize of output 16 [2019-01-14 02:31:13,904 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,913 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:13,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,981 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 41 treesize of output 50 [2019-01-14 02:31:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:13,998 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 23 treesize of output 16 [2019-01-14 02:31:13,999 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,007 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,024 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:14,030 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2019-01-14 02:31:14,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:14,035 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 36 treesize of output 27 [2019-01-14 02:31:14,036 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:14,093 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 34 treesize of output 43 [2019-01-14 02:31:14,105 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 23 treesize of output 19 [2019-01-14 02:31:14,106 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,214 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,228 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:14,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 96 [2019-01-14 02:31:14,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:14,314 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 73 treesize of output 68 [2019-01-14 02:31:14,315 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:14,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:14,833 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 53 treesize of output 60 [2019-01-14 02:31:14,834 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:15,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:15,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2019-01-14 02:31:15,295 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 59 [2019-01-14 02:31:16,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,269 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 23 treesize of output 16 [2019-01-14 02:31:16,269 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,286 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 61 treesize of output 81 [2019-01-14 02:31:16,556 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:16,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,636 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 117 [2019-01-14 02:31:16,639 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:16,718 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:16,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2019-01-14 02:31:16,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,874 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 23 treesize of output 16 [2019-01-14 02:31:16,874 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,964 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,061 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 45 treesize of output 54 [2019-01-14 02:31:17,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,065 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 23 treesize of output 16 [2019-01-14 02:31:17,066 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,077 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,156 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,208 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 96 [2019-01-14 02:31:17,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,273 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 23 treesize of output 22 [2019-01-14 02:31:17,273 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 68 [2019-01-14 02:31:17,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,353 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 23 treesize of output 16 [2019-01-14 02:31:17,353 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 43 [2019-01-14 02:31:17,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,380 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 23 treesize of output 16 [2019-01-14 02:31:17,380 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,384 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,390 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,400 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-01-14 02:31:17,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,409 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 36 treesize of output 27 [2019-01-14 02:31:17,410 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,428 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 34 treesize of output 43 [2019-01-14 02:31:17,432 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 23 treesize of output 19 [2019-01-14 02:31:17,433 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,438 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,447 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 83 [2019-01-14 02:31:17,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,485 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 72 treesize of output 65 [2019-01-14 02:31:17,485 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,562 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 51 treesize of output 56 [2019-01-14 02:31:17,563 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2019-01-14 02:31:17,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,627 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 23 treesize of output 16 [2019-01-14 02:31:17,628 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,634 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 47 [2019-01-14 02:31:17,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,693 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 23 treesize of output 16 [2019-01-14 02:31:17,694 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,701 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,722 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,742 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:31:17,774 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 2 variables, input treesize:204, output treesize:80 [2019-01-14 02:31:18,007 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:31:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:18,011 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:31:18,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-14 02:31:18,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 20 states and 27 transitions. Complement of second has 8 states. [2019-01-14 02:31:18,149 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-14 02:31:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:31:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-14 02:31:18,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2019-01-14 02:31:18,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:18,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2019-01-14 02:31:18,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:18,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2019-01-14 02:31:18,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:18,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-01-14 02:31:18,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:18,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2019-01-14 02:31:18,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:31:18,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:31:18,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-14 02:31:18,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:18,160 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 02:31:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-14 02:31:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-14 02:31:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:31:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-14 02:31:18,162 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 02:31:18,162 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 02:31:18,162 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:31:18,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-01-14 02:31:18,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:18,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:18,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:18,167 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:18,167 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:18,167 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 250#L556-4 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; 257#L555-1 assume !test_fun_#t~short8; 256#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 253#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 254#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 259#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 252#L556-1 [2019-01-14 02:31:18,167 INFO L796 eck$LassoCheckResult]: Loop: 252#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 251#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 252#L556-1 [2019-01-14 02:31:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2019-01-14 02:31:18,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:31:18,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:18,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:31:18,213 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:31:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2019-01-14 02:31:18,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:18,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,334 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:31:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:31:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:31:18,379 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:31:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:18,388 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-01-14 02:31:18,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:31:18,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2019-01-14 02:31:18,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:18,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2019-01-14 02:31:18,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:31:18,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:31:18,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-01-14 02:31:18,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:18,392 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-14 02:31:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-01-14 02:31:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:31:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:31:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-14 02:31:18,394 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-14 02:31:18,394 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-14 02:31:18,394 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:31:18,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-01-14 02:31:18,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:18,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:18,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:18,398 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:18,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:18,398 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 283#L556-4 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; 289#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 291#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 292#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 294#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 293#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 285#L556-1 [2019-01-14 02:31:18,398 INFO L796 eck$LassoCheckResult]: Loop: 285#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 284#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 285#L556-1 [2019-01-14 02:31:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2019-01-14 02:31:18,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:18,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2019-01-14 02:31:18,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2019-01-14 02:31:18,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:18,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:18,751 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:31:19,866 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 147 DAG size of output: 124 [2019-01-14 02:31:20,182 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-01-14 02:31:20,186 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:20,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:20,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:20,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:20,187 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:20,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:20,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:20,187 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:20,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-14 02:31:20,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:20,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:20,193 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-14 02:31:20,195 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-14 02:31:20,197 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-14 02:31:20,198 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-14 02:31:20,200 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-14 02:31:20,201 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-14 02:31:20,203 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-14 02:31:20,204 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-14 02:31:20,206 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-14 02:31:20,207 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-14 02:31:20,210 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-14 02:31:20,212 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-14 02:31:20,213 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-14 02:31:20,215 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-14 02:31:20,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-14 02:31:20,218 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-14 02:31:20,699 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-01-14 02:31:20,837 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-14 02:31:20,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-14 02:31:20,842 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-14 02:31:22,069 WARN L181 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:31:22,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:22,093 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:22,093 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-14 02:31:22,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,098 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-14 02:31:22,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,103 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-14 02:31:22,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,109 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-14 02:31:22,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,118 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-14 02:31:22,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,121 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-14 02:31:22,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,130 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-14 02:31:22,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,136 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-14 02:31:22,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,144 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-14 02:31:22,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,150 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-14 02:31:22,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,157 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-14 02:31:22,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,164 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-14 02:31:22,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,168 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-14 02:31:22,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,171 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-14 02:31:22,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,173 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-14 02:31:22,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:22,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:22,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:22,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,181 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-14 02:31:22,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:22,198 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-14 02:31:22,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:22,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:22,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:22,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:22,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:22,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:22,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:22,260 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:22,260 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:22,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:22,262 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:31:22,262 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:22,262 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*ULTIMATE.start_test_fun_#t~mem9 >= 0] [2019-01-14 02:31:22,457 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2019-01-14 02:31:22,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:22,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:22,545 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-01-14 02:31:22,554 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-14 02:31:22,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:22,585 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2019-01-14 02:31:22,590 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 31 treesize of output 30 [2019-01-14 02:31:22,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:22,696 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 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:31:22,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:22,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2019-01-14 02:31:22,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2019-01-14 02:31:22,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2019-01-14 02:31:22,921 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 26 treesize of output 25 [2019-01-14 02:31:22,922 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:23,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 47 [2019-01-14 02:31:23,084 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:23,167 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2019-01-14 02:31:23,303 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 25 treesize of output 37 [2019-01-14 02:31:23,308 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 26 treesize of output 25 [2019-01-14 02:31:23,309 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:23,347 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 23 treesize of output 20 [2019-01-14 02:31:23,347 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:23,370 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:23,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2019-01-14 02:31:23,551 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 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:31:23,552 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:23,648 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 23 treesize of output 22 [2019-01-14 02:31:23,648 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:23,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2019-01-14 02:31:23,731 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2019-01-14 02:31:23,810 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 28 treesize of output 25 [2019-01-14 02:31:23,811 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:23,868 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:31:23,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:31:23,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:31:24,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:24,039 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:64, output treesize:28 [2019-01-14 02:31:24,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-01-14 02:31:24,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2019-01-14 02:31:24,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:31:24,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:24,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:24,143 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-14 02:31:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:24,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:24,340 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 02:31:24,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:24,373 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2019-01-14 02:31:24,921 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-14 02:31:24,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:24,927 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 84 treesize of output 87 [2019-01-14 02:31:24,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,929 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:31:24,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:24,932 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 84 treesize of output 87 [2019-01-14 02:31:24,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,100 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 71 treesize of output 82 [2019-01-14 02:31:25,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2019-01-14 02:31:25,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,205 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 33 treesize of output 22 [2019-01-14 02:31:25,206 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,305 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 34 treesize of output 43 [2019-01-14 02:31:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,343 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 23 treesize of output 16 [2019-01-14 02:31:25,344 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,375 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,453 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2019-01-14 02:31:25,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,459 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 33 treesize of output 22 [2019-01-14 02:31:25,459 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,532 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 34 treesize of output 43 [2019-01-14 02:31:25,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,536 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 23 treesize of output 16 [2019-01-14 02:31:25,536 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,541 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,557 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,582 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2019-01-14 02:31:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 66 [2019-01-14 02:31:25,638 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,639 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:31:25,640 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,643 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 68 treesize of output 66 [2019-01-14 02:31:25,645 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2019-01-14 02:31:25,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,689 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-14 02:31:25,690 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,705 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 45 [2019-01-14 02:31:25,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:31:25,709 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,714 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,719 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,728 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 100 [2019-01-14 02:31:25,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,787 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 12 treesize of output 16 [2019-01-14 02:31:25,787 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2019-01-14 02:31:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,837 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 33 treesize of output 22 [2019-01-14 02:31:25,838 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 43 [2019-01-14 02:31:25,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:25,860 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 23 treesize of output 16 [2019-01-14 02:31:25,861 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,870 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,875 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,881 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:25,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:25,914 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2019-01-14 02:31:25,939 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-14 02:31:25,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-14 02:31:25,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-14 02:31:26,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 18 states and 21 transitions. Complement of second has 5 states. [2019-01-14 02:31:26,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2019-01-14 02:31:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:31:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:31:26,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:31:26,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:26,030 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:31:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:26,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:26,113 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-01-14 02:31:26,129 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-14 02:31:26,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:26,173 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2019-01-14 02:31:26,178 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 31 treesize of output 30 [2019-01-14 02:31:26,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:26,229 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 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:31:26,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:26,300 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 29 treesize of output 39 [2019-01-14 02:31:26,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2019-01-14 02:31:26,321 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2019-01-14 02:31:26,390 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 26 treesize of output 25 [2019-01-14 02:31:26,391 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:26,445 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:31:26,480 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 25 treesize of output 37 [2019-01-14 02:31:26,484 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 26 treesize of output 25 [2019-01-14 02:31:26,484 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:26,535 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 23 treesize of output 20 [2019-01-14 02:31:26,535 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:26,576 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:26,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2019-01-14 02:31:26,734 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 31 treesize of output 30 [2019-01-14 02:31:26,734 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:26,846 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 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:31:26,847 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:26,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2019-01-14 02:31:26,933 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2019-01-14 02:31:27,014 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 28 treesize of output 25 [2019-01-14 02:31:27,015 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,074 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:31:27,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:31:27,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:31:27,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:27,312 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:64, output treesize:28 [2019-01-14 02:31:27,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-01-14 02:31:27,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:31:27,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2019-01-14 02:31:27,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:27,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:27,377 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-14 02:31:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:27,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:27,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:27,525 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2019-01-14 02:31:28,187 WARN L181 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-14 02:31:28,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,192 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 84 treesize of output 87 [2019-01-14 02:31:28,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,196 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 84 treesize of output 87 [2019-01-14 02:31:28,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,200 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:31:28,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,365 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 71 treesize of output 82 [2019-01-14 02:31:28,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2019-01-14 02:31:28,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,478 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 33 treesize of output 22 [2019-01-14 02:31:28,479 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 43 [2019-01-14 02:31:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,510 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 23 treesize of output 16 [2019-01-14 02:31:28,511 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,517 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 76 [2019-01-14 02:31:28,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,604 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 51 treesize of output 50 [2019-01-14 02:31:28,605 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 50 treesize of output 49 [2019-01-14 02:31:28,673 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:28,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 80 [2019-01-14 02:31:28,785 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:28,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,826 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 66 treesize of output 93 [2019-01-14 02:31:28,829 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-14 02:31:28,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:28,960 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 51 treesize of output 54 [2019-01-14 02:31:28,961 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,017 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:31:29,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,121 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 41 treesize of output 50 [2019-01-14 02:31:29,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,171 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 23 treesize of output 16 [2019-01-14 02:31:29,172 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,221 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 79 [2019-01-14 02:31:29,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,343 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 74 treesize of output 67 [2019-01-14 02:31:29,343 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,425 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 3 case distinctions, treesize of input 41 treesize of output 70 [2019-01-14 02:31:29,427 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2019-01-14 02:31:29,491 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:31:29,577 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:31:29,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 100 [2019-01-14 02:31:29,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,678 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 12 treesize of output 16 [2019-01-14 02:31:29,678 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2019-01-14 02:31:29,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,712 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 33 treesize of output 22 [2019-01-14 02:31:29,713 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 43 [2019-01-14 02:31:29,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,731 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 23 treesize of output 16 [2019-01-14 02:31:29,731 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,736 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,742 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,749 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,754 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2019-01-14 02:31:29,903 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 02:31:29,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 66 [2019-01-14 02:31:29,909 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,948 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 68 treesize of output 66 [2019-01-14 02:31:29,949 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,950 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:31:29,950 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:29,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2019-01-14 02:31:29,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:29,997 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-14 02:31:29,998 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:30,017 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 45 [2019-01-14 02:31:30,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:30,027 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 23 treesize of output 16 [2019-01-14 02:31:30,027 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,032 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,037 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,046 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:30,080 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2019-01-14 02:31:30,164 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-14 02:31:30,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-14 02:31:30,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-14 02:31:30,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 26 states and 31 transitions. Complement of second has 6 states. [2019-01-14 02:31:30,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:31:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-14 02:31:30,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:31:30,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:30,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:31:30,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:30,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:31:30,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:30,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2019-01-14 02:31:30,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:30,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-01-14 02:31:30,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:31:30,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:31:30,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-14 02:31:30,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:30,258 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:31:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-14 02:31:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-14 02:31:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:31:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-14 02:31:30,260 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 02:31:30,260 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 02:31:30,260 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:31:30,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-01-14 02:31:30,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:30,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:30,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:30,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-01-14 02:31:30,262 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:30,262 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 547#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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, 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_~c~0.base, test_fun_~c~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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 548#L556-4 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; 554#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 557#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 558#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 559#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 551#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 552#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 555#L556-4 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; 556#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 563#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 562#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 561#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 560#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 550#L556-1 [2019-01-14 02:31:30,262 INFO L796 eck$LassoCheckResult]: Loop: 550#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 549#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 550#L556-1 [2019-01-14 02:31:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2019-01-14 02:31:30,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:30,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:30,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:31:30,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:31:30,367 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-14 02:31:30,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:31:30,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:31:30,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:31:30,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:30,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2019-01-14 02:31:30,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 [2019-01-14 02:31:30,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:30,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-14 02:31:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:31:30,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:31:30,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 02:31:30,491 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:31:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2019-01-14 02:31:30,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:30,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:30,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:31:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:31:30,648 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-14 02:31:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:30,705 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-14 02:31:30,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:30,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2019-01-14 02:31:30,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:30,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-14 02:31:30,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:31:30,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:31:30,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:31:30,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:30,708 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:30,708 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:30,708 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:30,708 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:31:30,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:31:30,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:30,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:31:30,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:31:30 BoogieIcfgContainer [2019-01-14 02:31:30,716 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:31:30,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:31:30,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:31:30,716 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:31:30,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:05" (3/4) ... [2019-01-14 02:31:30,720 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:31:30,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:31:30,721 INFO L168 Benchmark]: Toolchain (without parser) took 26347.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 946.0 MB in the beginning and 840.5 MB in the end (delta: 105.5 MB). Peak memory consumption was 452.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:30,722 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:30,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:30,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.71 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-14 02:31:30,723 INFO L168 Benchmark]: Boogie Preprocessor took 53.39 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-14 02:31:30,723 INFO L168 Benchmark]: RCFGBuilder took 458.04 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:30,724 INFO L168 Benchmark]: BuchiAutomizer took 25002.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.0 MB). Free memory was 1.1 GB in the beginning and 840.5 MB in the end (delta: 254.5 MB). Peak memory consumption was 460.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:30,724 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 840.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:30,727 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 745.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.71 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 53.39 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 458.04 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: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25002.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.0 MB). Free memory was 1.1 GB in the beginning and 840.5 MB in the end (delta: 254.5 MB). Peak memory consumption was 460.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 840.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 9.6s. Construction of modules took 0.2s. Büchi inclusion checks took 14.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 5. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 44 SDtfs, 32 SDslu, 28 SDs, 0 SdLazy, 79 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1360 mio100 ax102 hnf100 lsp96 ukn26 mio100 lsp34 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf293 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...