./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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/c.01_assume-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:31:33,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:31:33,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:31:33,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:31:33,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:31:33,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:31:33,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:31:33,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:31:33,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:31:33,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:31:33,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:31:33,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:31:33,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:31:33,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:31:33,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:31:33,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:31:33,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:31:33,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:31:33,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:31:33,325 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:31:33,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:31:33,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:31:33,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:31:33,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:31:33,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:31:33,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:31:33,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:31:33,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:31:33,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:31:33,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:31:33,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:31:33,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:31:33,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:31:33,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:31:33,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:31:33,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:31:33,339 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:33,355 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:31:33,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:31:33,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:31:33,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:31:33,356 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:31:33,357 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:31:33,357 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:31:33,357 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:31:33,357 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:31:33,357 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:31:33,358 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:31:33,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:31:33,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:31:33,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:31:33,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:31:33,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:31:33,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:31:33,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:31:33,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:31:33,360 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:31:33,360 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:31:33,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:31:33,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:31:33,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:31:33,362 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:31:33,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:31:33,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:31:33,363 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:31:33,364 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:31:33,365 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2019-01-14 02:31:33,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:31:33,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:31:33,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:31:33,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:31:33,416 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:31:33,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:33,469 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86847b1c9/355773b5293742d9a9d6d3d9cefad794/FLAG2b0124f9d [2019-01-14 02:31:33,907 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:31:33,908 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:33,919 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86847b1c9/355773b5293742d9a9d6d3d9cefad794/FLAG2b0124f9d [2019-01-14 02:31:34,245 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86847b1c9/355773b5293742d9a9d6d3d9cefad794 [2019-01-14 02:31:34,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:31:34,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:31:34,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:31:34,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:31:34,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:31:34,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:31:34" (1/1) ... [2019-01-14 02:31:34,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9334c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:34, skipping insertion in model container [2019-01-14 02:31:34,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:31:34" (1/1) ... [2019-01-14 02:31:34,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:31:34,318 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:31:34,691 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:31:34,703 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:31:34,767 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:31:34,821 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:31:34,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:34 WrapperNode [2019-01-14 02:31:34,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:31:34,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:31:34,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:31:34,890 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:31:34,899 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:34" (1/1) ... [2019-01-14 02:31:34,914 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:34" (1/1) ... [2019-01-14 02:31:34,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:31:34,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:31:34,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:31:34,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:31:34,943 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:34" (1/1) ... [2019-01-14 02:31:34,943 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:34" (1/1) ... [2019-01-14 02:31:34,946 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:34" (1/1) ... [2019-01-14 02:31:34,947 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:34" (1/1) ... [2019-01-14 02:31:34,952 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:34" (1/1) ... [2019-01-14 02:31:34,957 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:34" (1/1) ... [2019-01-14 02:31:34,959 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:34" (1/1) ... [2019-01-14 02:31:34,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:31:34,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:31:34,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:31:34,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:31:34,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:34" (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:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:31:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:31:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:31:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:31:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:31:35,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:31:35,431 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:31:35,431 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:31:35,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:35 BoogieIcfgContainer [2019-01-14 02:31:35,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:31:35,433 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:31:35,433 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:31:35,437 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:31:35,438 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:35,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:31:34" (1/3) ... [2019-01-14 02:31:35,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47ad7f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:31:35, skipping insertion in model container [2019-01-14 02:31:35,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:35,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:34" (2/3) ... [2019-01-14 02:31:35,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47ad7f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:31:35, skipping insertion in model container [2019-01-14 02:31:35,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:35,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:35" (3/3) ... [2019-01-14 02:31:35,442 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:35,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:31:35,497 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:31:35,498 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:31:35,498 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:31:35,498 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:31:35,498 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:31:35,498 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:31:35,499 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:31:35,499 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:31:35,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:31:35,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:35,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:35,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:35,538 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:35,538 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:35,539 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:31:35,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:31:35,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:35,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:35,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:35,541 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:35,541 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:35,550 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L553-3true [2019-01-14 02:31:35,550 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2019-01-14 02:31:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:31:35,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:35,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2019-01-14 02:31:35,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:35,749 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:35,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:35,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:31:35,755 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:31:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:31:35,769 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 02:31:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:35,776 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-14 02:31:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:31:35,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-14 02:31:35,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:35,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2019-01-14 02:31:35,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:31:35,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:31:35,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 02:31:35,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:35,786 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:31:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 02:31:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 02:31:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:31:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-14 02:31:35,816 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:31:35,816 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:31:35,816 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:31:35,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-01-14 02:31:35,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:35,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:35,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:35,817 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:35,817 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:31:35,818 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 37#L553-3 [2019-01-14 02:31:35,818 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2019-01-14 02:31:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:31:35,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2019-01-14 02:31:35,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:35,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:36,012 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:36,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:36,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:31:36,012 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:36,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:36,013 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-01-14 02:31:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:36,335 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-14 02:31:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:36,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-01-14 02:31:36,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:31:36,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 02:31:36,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:31:36,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:31:36,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-01-14 02:31:36,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:36,339 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 02:31:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-01-14 02:31:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-14 02:31:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:31:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-01-14 02:31:36,342 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-14 02:31:36,342 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-14 02:31:36,342 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:31:36,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-01-14 02:31:36,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:31:36,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:36,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:36,343 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:36,343 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:31:36,344 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 73#L553-3 [2019-01-14 02:31:36,344 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2019-01-14 02:31:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:36,344 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 02:31:36,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:36,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2019-01-14 02:31:36,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:36,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2019-01-14 02:31:36,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:36,693 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-14 02:31:36,812 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:31:37,262 WARN L181 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-14 02:31:37,518 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-14 02:31:37,531 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:37,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:37,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:37,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:37,533 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:37,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:37,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:37,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:37,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-14 02:31:37,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:37,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:37,558 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:37,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:37,593 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:37,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:37,603 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:37,607 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:37,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:37,622 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:37,625 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:37,629 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:37,633 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:37,638 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:37,641 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:37,646 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:37,947 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-01-14 02:31:38,132 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-01-14 02:31:38,133 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:38,135 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:38,139 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:38,146 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:38,148 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:38,824 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:38,870 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:38,875 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:38,878 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:38,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,889 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:38,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:38,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,901 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:38,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:38,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,912 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:38,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:38,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:38,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,922 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:38,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:38,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,935 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:38,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:38,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:38,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,946 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:38,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,951 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:38,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:38,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:38,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,961 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:38,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,967 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:38,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:38,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:38,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:38,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,972 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:38,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:38,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:38,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:38,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:38,996 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:38,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:38,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:38,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:38,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:39,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:39,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:39,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:39,014 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:39,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:39,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:39,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:39,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:39,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:39,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:39,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:39,032 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:39,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:39,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:39,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:39,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:39,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:39,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:39,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:39,042 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:39,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:39,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:39,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:39,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:39,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:39,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:39,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:39,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:39,102 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:31:39,104 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:39,111 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:39,113 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:39,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2019-01-14 02:31:39,165 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:31:39,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:39,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:39,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:39,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 02:31:39,466 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:39,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:39,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:39,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:31:39,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-01-14 02:31:39,608 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:39,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:31:39,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:31:39,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2019-01-14 02:31:39,825 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:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:31:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 02:31:39,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:31:39,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:39,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:31:39,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:39,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-14 02:31:39,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:39,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-01-14 02:31:39,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:31:39,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2019-01-14 02:31:39,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:31:39,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:31:39,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-01-14 02:31:39,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:39,837 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 02:31:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-01-14 02:31:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-14 02:31:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 02:31:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-14 02:31:39,842 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 02:31:39,842 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 02:31:39,843 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:31:39,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-14 02:31:39,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:31:39,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:39,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:39,846 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:31:39,847 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:39,847 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-01-14 02:31:39,847 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-01-14 02:31:39,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:31:39,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:39,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2019-01-14 02:31:39,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:31:40,039 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:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:40,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:40,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 02:31:40,127 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:40,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:40,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:40,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:40,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-14 02:31:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:40,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:31:40,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:40,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-14 02:31:40,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:40,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:40,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:40,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-01-14 02:31:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:40,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:31:40,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-14 02:31:40,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:40,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:31:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:31:40,264 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-01-14 02:31:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:40,417 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-01-14 02:31:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:31:40,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2019-01-14 02:31:40,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-01-14 02:31:40,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2019-01-14 02:31:40,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:31:40,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:31:40,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2019-01-14 02:31:40,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:40,422 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-01-14 02:31:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2019-01-14 02:31:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-01-14 02:31:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:31:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-01-14 02:31:40,427 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-14 02:31:40,427 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-14 02:31:40,428 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:31:40,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-01-14 02:31:40,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:31:40,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:40,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:40,430 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:31:40,430 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:40,431 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-01-14 02:31:40,431 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-01-14 02:31:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-14 02:31:40,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:40,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:40,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2019-01-14 02:31:40,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:40,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2019-01-14 02:31:40,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:41,025 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-01-14 02:31:41,369 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-01-14 02:31:41,485 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-14 02:31:41,489 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:41,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:41,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:41,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:41,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:41,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:41,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:41,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:41,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-14 02:31:41,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:41,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:41,494 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:41,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:41,538 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:41,541 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:41,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:41,545 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:41,550 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:41,553 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:41,556 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:41,558 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:41,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:41,564 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:41,567 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:41,569 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:41,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:41,574 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:41,577 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:41,580 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:41,584 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:41,784 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-01-14 02:31:41,923 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-14 02:31:42,504 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:31:42,674 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:42,692 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:42,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:42,693 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:42,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,699 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:42,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,711 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:42,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,736 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:42,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,751 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:42,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,758 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:42,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,763 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:42,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,772 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:42,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,778 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:42,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,785 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:42,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,790 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:42,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,798 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:42,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,807 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:42,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:42,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:42,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:42,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,813 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:42,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,842 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:42,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:42,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:42,898 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:42,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:42,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:42,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:42,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:42,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:42,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:42,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:42,932 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:42,933 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:42,933 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:42,934 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:42,934 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:42,935 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2019-01-14 02:31:43,218 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:31:43,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:43,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:43,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:43,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2019-01-14 02:31:43,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2019-01-14 02:31:43,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:43,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2019-01-14 02:31:43,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:31:43,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:43,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:43,696 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:30 [2019-01-14 02:31:43,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:43,986 INFO L303 Elim1Store]: Index analysis took 140 ms [2019-01-14 02:31:44,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2019-01-14 02:31:44,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2019-01-14 02:31:44,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:44,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-01-14 02:31:44,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:44,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:44,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:44,170 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:52, output treesize:56 [2019-01-14 02:31:44,442 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-14 02:31:44,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2019-01-14 02:31:44,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-14 02:31:44,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:44,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:44,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2019-01-14 02:31:44,633 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:31:44,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:44,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-14 02:31:44,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:44,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:44,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:31:44,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:60 [2019-01-14 02:31:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:44,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-14 02:31:44,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2019-01-14 02:31:45,259 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-01-14 02:31:45,508 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2019-01-14 02:31:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:31:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2019-01-14 02:31:45,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-14 02:31:45,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:45,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2019-01-14 02:31:45,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:45,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2019-01-14 02:31:45,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:45,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2019-01-14 02:31:45,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-01-14 02:31:45,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2019-01-14 02:31:45,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 02:31:45,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-14 02:31:45,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2019-01-14 02:31:45,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:45,519 INFO L706 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2019-01-14 02:31:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2019-01-14 02:31:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-01-14 02:31:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 02:31:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2019-01-14 02:31:45,530 INFO L729 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-01-14 02:31:45,530 INFO L609 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-01-14 02:31:45,530 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:31:45,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2019-01-14 02:31:45,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-01-14 02:31:45,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:45,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:45,534 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:31:45,534 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 02:31:45,535 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-01-14 02:31:45,536 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-01-14 02:31:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-14 02:31:45,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:45,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:45,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2019-01-14 02:31:45,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:45,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2019-01-14 02:31:45,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:45,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:45,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:31:45,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:31:45,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:45,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:45,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 02:31:45,893 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:45,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:45,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:45,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:45,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-14 02:31:45,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:45,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:31:46,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:46,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-14 02:31:46,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-01-14 02:31:46,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:46,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 02:31:46,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:46,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2019-01-14 02:31:46,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:46,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-01-14 02:31:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:31:46,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-14 02:31:46,727 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2019-01-14 02:31:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:31:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:31:46,799 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2019-01-14 02:31:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:47,018 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2019-01-14 02:31:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:31:47,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2019-01-14 02:31:47,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 02:31:47,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2019-01-14 02:31:47,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2019-01-14 02:31:47,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-01-14 02:31:47,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2019-01-14 02:31:47,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:47,028 INFO L706 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2019-01-14 02:31:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2019-01-14 02:31:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2019-01-14 02:31:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 02:31:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-01-14 02:31:47,041 INFO L729 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-14 02:31:47,041 INFO L609 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-14 02:31:47,041 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:31:47,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2019-01-14 02:31:47,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-01-14 02:31:47,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:47,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:47,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:31:47,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:31:47,045 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-01-14 02:31:47,045 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-01-14 02:31:47,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-01-14 02:31:47,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:47,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2019-01-14 02:31:47,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:47,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:47,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:47,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2019-01-14 02:31:47,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:47,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:47,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:47,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:48,203 WARN L181 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2019-01-14 02:31:48,318 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 02:31:48,544 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-01-14 02:31:48,632 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:48,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:48,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:48,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:48,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:48,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:48,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:48,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:48,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2019-01-14 02:31:48,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:48,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:48,637 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:48,640 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:48,664 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:48,688 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:48,719 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:48,721 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:48,740 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:48,742 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:48,743 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:48,746 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:48,757 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:48,759 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:48,763 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:48,765 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:48,767 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:48,783 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:48,785 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:48,787 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:48,789 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:48,997 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-14 02:31:49,084 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:49,581 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:49,778 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:31:49,882 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:49,882 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:49,883 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:49,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:49,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,888 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:49,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,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:49,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:49,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,902 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:49,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,908 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:49,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,912 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:49,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:49,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,922 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:49,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:49,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,929 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:49,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,934 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:49,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:49,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:49,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,946 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:49,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,954 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:49,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:49,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,962 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:49,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,967 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:49,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:49,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,976 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:49,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,982 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:49,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:49,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:49,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:49,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,987 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:49,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:49,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:49,996 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:49,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:49,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:49,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:49,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:49,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:49,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:50,010 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:50,041 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:31:50,041 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:31:50,042 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:50,047 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:50,047 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:50,047 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-01-14 02:31:50,358 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:31:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:50,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:50,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:51,057 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-01-14 02:31:51,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2019-01-14 02:31:51,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2019-01-14 02:31:51,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:31:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-14 02:31:51,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:31:51,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:31:51,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:31:51,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2019-01-14 02:31:51,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-14 02:31:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-01-14 02:31:51,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2019-01-14 02:31:51,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-14 02:31:51,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:31:51,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-14 02:31:51,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-14 02:31:51,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-14 02:31:51,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2019-01-14 02:31:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:51,816 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:51,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:51,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:31:51,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-14 02:31:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:51,951 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-14 02:31:51,951 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-01-14 02:31:52,515 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-01-14 02:31:52,714 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-01-14 02:31:52,967 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-14 02:31:54,240 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2019-01-14 02:31:56,257 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-01-14 02:31:56,325 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2019-01-14 02:31:56,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:31:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-01-14 02:31:56,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2019-01-14 02:31:56,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:56,328 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:31:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:56,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:56,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:56,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2019-01-14 02:31:56,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-14 02:31:56,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:31:56,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2019-01-14 02:31:56,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:31:56,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:31:56,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:31:56,706 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2019-01-14 02:31:56,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-14 02:31:56,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-01-14 02:31:56,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:56,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:56,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2019-01-14 02:31:56,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:56,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-14 02:31:56,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:56,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:56,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:31:56,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-14 02:31:57,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:57,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-14 02:31:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:57,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-14 02:31:57,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:57,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:57,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:57,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2019-01-14 02:31:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:57,163 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:57,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:57,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:57,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:31:57,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2019-01-14 02:31:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:57,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-14 02:31:57,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-01-14 02:31:58,105 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-14 02:31:59,046 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 353 states and 447 transitions. Complement of second has 29 states. [2019-01-14 02:31:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:31:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2019-01-14 02:31:59,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 14 letters. [2019-01-14 02:31:59,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:59,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 18 letters. Loop has 14 letters. [2019-01-14 02:31:59,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:59,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 28 letters. [2019-01-14 02:31:59,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:59,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 447 transitions. [2019-01-14 02:31:59,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-01-14 02:31:59,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 286 states and 366 transitions. [2019-01-14 02:31:59,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-01-14 02:31:59,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-14 02:31:59,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 366 transitions. [2019-01-14 02:31:59,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:59,056 INFO L706 BuchiCegarLoop]: Abstraction has 286 states and 366 transitions. [2019-01-14 02:31:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 366 transitions. [2019-01-14 02:31:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 233. [2019-01-14 02:31:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-14 02:31:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2019-01-14 02:31:59,074 INFO L729 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-01-14 02:31:59,074 INFO L609 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-01-14 02:31:59,074 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:31:59,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2019-01-14 02:31:59,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-14 02:31:59,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:59,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:59,079 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:59,079 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:59,079 INFO L794 eck$LassoCheckResult]: Stem: 1944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1942#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1943#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1945#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1946#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2019-01-14 02:31:59,079 INFO L796 eck$LassoCheckResult]: Loop: 1959#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1950#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1951#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1954#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2019-01-14 02:31:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-14 02:31:59,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:59,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:59,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2019-01-14 02:31:59,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:59,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2019-01-14 02:31:59,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:59,484 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-14 02:31:59,588 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 02:31:59,899 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-01-14 02:32:00,514 WARN L181 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2019-01-14 02:32:00,517 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:00,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:00,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:00,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:00,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:00,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:00,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:00,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:00,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2019-01-14 02:32:00,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:00,519 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:00,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:00,562 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:32:00,595 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:32:00,619 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:32:00,625 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:32:00,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:00,636 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:32:00,637 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:32:00,639 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:32:00,640 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:32:01,251 WARN L181 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-01-14 02:32:01,383 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-14 02:32:01,384 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:32:01,386 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:32:01,387 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:32:01,390 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:32:01,391 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:32:01,393 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:32:01,919 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:32:02,183 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:32:02,386 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 02:32:02,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:02,441 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:02,441 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:32:02,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:02,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:02,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:02,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,443 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:32:02,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:02,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,452 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:32:02,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:02,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:02,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:02,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,458 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:32:02,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:02,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:02,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:02,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,463 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:32:02,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:02,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,469 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:32:02,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:02,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:02,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:02,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,475 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:32:02,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:02,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:02,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:02,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,477 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:32:02,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:02,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:02,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:02,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:02,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:02,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,502 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:32:02,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,505 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:32:02,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,507 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:02,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,525 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:32:02,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:02,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:02,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:02,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,546 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:32:02,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:02,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:02,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:02,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:02,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:02,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:02,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:02,560 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:02,560 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:02,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:02,572 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:02,572 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:02,739 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:02,926 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:32:02,926 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:32:02,927 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:02,928 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:32:02,928 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:02,928 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2019-01-14 02:32:03,227 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:32:03,240 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:03,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:03,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:03,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:03,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-14 02:32:03,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:03,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-14 02:32:03,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:03,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:03,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:03,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-14 02:32:03,722 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:32:03,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:32:03,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2019-01-14 02:32:03,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2019-01-14 02:32:03,796 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:32:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-14 02:32:03,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:32:03,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:03,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:32:03,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:03,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:32:03,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:03,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2019-01-14 02:32:03,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-14 02:32:03,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2019-01-14 02:32:03,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-14 02:32:03,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-01-14 02:32:03,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2019-01-14 02:32:03,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:03,814 INFO L706 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2019-01-14 02:32:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2019-01-14 02:32:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2019-01-14 02:32:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-14 02:32:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2019-01-14 02:32:03,846 INFO L729 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-01-14 02:32:03,846 INFO L609 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-01-14 02:32:03,846 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:32:03,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2019-01-14 02:32:03,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-14 02:32:03,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:03,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:03,851 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:03,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:03,852 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2647#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2648#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2664#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2835#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2796#L555-1 assume !test_fun_#t~short8; 2725#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 2678#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2675#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2019-01-14 02:32:03,852 INFO L796 eck$LassoCheckResult]: Loop: 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2724#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2714#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2650#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2651#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2696#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2681#L555-1 assume !test_fun_#t~short8; 2683#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 2667#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2668#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2019-01-14 02:32:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2019-01-14 02:32:03,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:03,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:03,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2019-01-14 02:32:03,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:03,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2019-01-14 02:32:03,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:03,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:03,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:32:04,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:32:04,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:32:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:32:04,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 02:32:04,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:32:04,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:04,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:32:04,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-01-14 02:32:04,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 02:32:04,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 8 treesize of output 7 [2019-01-14 02:32:04,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 02:32:04,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:04,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-01-14 02:32:04,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:04,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-01-14 02:32:04,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-01-14 02:32:04,302 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 02:32:04,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-14 02:32:04,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:04,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-01-14 02:32:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:32:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:32:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-01-14 02:32:04,564 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-01-14 02:32:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:32:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:32:04,610 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 12 states. [2019-01-14 02:32:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:04,757 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2019-01-14 02:32:04,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:32:04,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2019-01-14 02:32:04,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-01-14 02:32:04,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2019-01-14 02:32:04,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-14 02:32:04,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-14 02:32:04,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2019-01-14 02:32:04,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:04,765 INFO L706 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2019-01-14 02:32:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2019-01-14 02:32:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-01-14 02:32:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 02:32:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-01-14 02:32:04,769 INFO L729 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-14 02:32:04,769 INFO L609 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-14 02:32:04,769 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:32:04,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2019-01-14 02:32:04,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-01-14 02:32:04,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:04,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:04,771 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:04,771 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:32:04,772 INFO L794 eck$LassoCheckResult]: Stem: 3303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3301#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3302#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3346#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3345#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3340#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3341#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3336#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3337#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3333#L555-1 assume !test_fun_#t~short8; 3332#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 3331#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3329#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3318#L553-1 [2019-01-14 02:32:04,772 INFO L796 eck$LassoCheckResult]: Loop: 3318#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3397#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3393#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3392#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3391#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3390#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3388#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3384#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3385#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3376#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3377#L555-1 assume !test_fun_#t~short8; 3327#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 3328#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3317#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3318#L553-1 [2019-01-14 02:32:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:04,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2019-01-14 02:32:04,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:04,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:04,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2019-01-14 02:32:04,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:04,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2019-01-14 02:32:04,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:04,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:04,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:04,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:04,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:32:05,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:32:05,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:32:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:32:05,132 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-01-14 02:32:05,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:32:05,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:05,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 02:32:05,143 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:32:05,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-14 02:32:05,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2019-01-14 02:32:05,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-01-14 02:32:05,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-01-14 02:32:05,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:05,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:05,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-01-14 02:32:05,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2019-01-14 02:32:05,496 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-14 02:32:05,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2019-01-14 02:32:05,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-14 02:32:05,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:05,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:47 [2019-01-14 02:32:05,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2019-01-14 02:32:05,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2019-01-14 02:32:05,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:05,696 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:32:05,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2019-01-14 02:32:05,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:05,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:05,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:32:05,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:49 [2019-01-14 02:32:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:32:05,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:32:05,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-01-14 02:32:06,234 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2019-01-14 02:32:06,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 02:32:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-01-14 02:32:06,274 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2019-01-14 02:32:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:06,787 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-01-14 02:32:06,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 02:32:06,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2019-01-14 02:32:06,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:32:06,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2019-01-14 02:32:06,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 02:32:06,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 02:32:06,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2019-01-14 02:32:06,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:06,792 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-01-14 02:32:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2019-01-14 02:32:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-01-14 02:32:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 02:32:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-01-14 02:32:06,796 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-01-14 02:32:06,796 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-01-14 02:32:06,796 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:32:06,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2019-01-14 02:32:06,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:32:06,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:06,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:06,805 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:32:06,805 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:32:06,805 INFO L794 eck$LassoCheckResult]: Stem: 3661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3659#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3660#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3666#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3667#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3697#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3696#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3695#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3694#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3693#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3692#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3691#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3690#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3679#L555-1 assume !test_fun_#t~short8; 3677#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 3676#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3673#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3668#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3669#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3674#L555-1 [2019-01-14 02:32:06,805 INFO L796 eck$LassoCheckResult]: Loop: 3674#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3663#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3670#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3674#L555-1 [2019-01-14 02:32:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2019-01-14 02:32:06,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:06,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2019-01-14 02:32:06,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:06,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2019-01-14 02:32:06,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:06,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:06,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:06,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:06,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:07,131 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-14 02:32:07,237 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 02:32:09,055 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 201 DAG size of output: 153 [2019-01-14 02:32:09,209 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-14 02:32:09,212 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:09,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:09,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:09,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:09,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:09,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:09,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:09,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:09,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2019-01-14 02:32:09,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:09,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:09,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:32:09,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:09,339 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:32:09,378 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:32:09,401 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:32:09,406 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:32:09,409 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:32:09,411 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:32:09,413 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:32:09,420 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:32:09,421 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:32:09,624 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-14 02:32:09,760 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-14 02:32:09,760 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:32:09,765 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:32:09,767 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:32:09,769 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:32:09,772 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:32:09,775 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:32:09,777 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:32:10,210 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:32:10,423 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 02:32:10,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:10,525 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:10,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:10,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:10,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:10,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:10,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,537 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:32:10,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:10,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:10,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:10,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,544 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:32:10,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,546 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:32:10,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:10,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:10,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,557 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:32:10,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,563 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:32:10,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:10,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,572 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:32:10,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:10,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:10,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:10,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,574 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:32:10,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,574 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:32:10,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:10,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,583 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:10,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:10,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:10,600 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:32:10,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:10,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:10,604 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:10,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:10,616 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:32:10,617 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:10,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:10,998 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:32:11,005 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:32:11,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:11,009 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:32:11,010 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:11,010 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2019-01-14 02:32:11,306 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:32:11,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:32:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:11,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:11,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:12,020 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-14 02:32:12,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:12,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-14 02:32:12,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:12,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-14 02:32:12,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-14 02:32:12,377 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:32:12,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:32:12,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:32:12,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2019-01-14 02:32:12,424 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:32:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 02:32:12,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-14 02:32:12,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:12,425 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:12,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:12,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:12,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:12,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-14 02:32:12,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:12,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-14 02:32:12,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-14 02:32:12,609 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:32:12,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:32:12,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:32:12,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2019-01-14 02:32:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-14 02:32:12,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-14 02:32:12,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:12,693 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:12,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:12,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:12,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:12,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-14 02:32:12,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:32:12,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2019-01-14 02:32:12,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:12,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2019-01-14 02:32:12,883 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:32:12,883 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:32:12,883 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:32:12,920 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2019-01-14 02:32:12,923 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:32:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:32:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:32:12,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-14 02:32:12,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:12,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2019-01-14 02:32:12,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:12,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2019-01-14 02:32:12,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:12,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2019-01-14 02:32:12,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:12,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-01-14 02:32:12,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:32:12,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:32:12,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:32:12,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:12,931 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:12,931 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:12,931 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:12,931 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:32:12,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:32:12,931 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:12,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:32:12,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:32:12 BoogieIcfgContainer [2019-01-14 02:32:12,946 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:32:12,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:32:12,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:32:12,947 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:32:12,948 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:35" (3/4) ... [2019-01-14 02:32:12,960 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:32:12,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:32:12,961 INFO L168 Benchmark]: Toolchain (without parser) took 38711.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 952.7 MB in the beginning and 990.2 MB in the end (delta: -37.5 MB). Peak memory consumption was 383.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:12,963 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:12,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:12,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:12,964 INFO L168 Benchmark]: Boogie Preprocessor took 25.94 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:32:12,964 INFO L168 Benchmark]: RCFGBuilder took 471.05 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.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:12,964 INFO L168 Benchmark]: BuchiAutomizer took 37513.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 284.2 MB). Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 114.1 MB). Peak memory consumption was 398.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:12,972 INFO L168 Benchmark]: Witness Printer took 12.84 ms. Allocated memory is still 1.4 GB. Free memory is still 990.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:12,980 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 570.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.94 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 471.05 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.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37513.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 284.2 MB). Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 114.1 MB). Peak memory consumption was 398.3 MB. Max. memory is 11.5 GB. * Witness Printer took 12.84 ms. Allocated memory is still 1.4 GB. Free memory is still 990.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.4s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 21.9s. Construction of modules took 1.9s. Büchi inclusion checks took 13.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 182 SDslu, 81 SDs, 0 SdLazy, 763 SolverSat, 166 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax105 hnf99 lsp83 ukn57 mio100 lsp33 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf211 smp79 tf100 neg95 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 376ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...