./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer --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 f5878942b695ddbfe46daa43f5d95028455ef120 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:05:06,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:05:06,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:05:06,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:05:06,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:05:06,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:05:06,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:05:06,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:05:06,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:05:06,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:05:06,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:05:06,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:05:06,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:05:06,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:05:06,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:05:06,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:05:06,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:05:06,986 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:05:06,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:05:06,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:05:06,989 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:05:06,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:05:06,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:05:06,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:05:06,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:05:06,992 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:05:06,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:05:06,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:05:06,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:05:06,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:05:06,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:05:06,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:05:06,997 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:05:06,997 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:05:06,998 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:05:06,999 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:05:06,999 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:05:07,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:05:07,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:05:07,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:05:07,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:05:07,011 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:05:07,012 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:05:07,012 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:05:07,012 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:05:07,012 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:05:07,012 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:05:07,012 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:05:07,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:05:07,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:05:07,013 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:05:07,014 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:05:07,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:05:07,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:05:07,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:05:07,014 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:05:07,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:05:07,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:05:07,015 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:05:07,015 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:05:07,015 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer 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 -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-11-28 13:05:07,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:05:07,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:05:07,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:05:07,048 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:05:07,048 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:05:07,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-28 13:05:07,083 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/data/c1ffd5f56/9787ddc64eab4eb589ae2a5677766f49/FLAG001d67c74 [2018-11-28 13:05:07,414 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:05:07,414 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-28 13:05:07,421 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/data/c1ffd5f56/9787ddc64eab4eb589ae2a5677766f49/FLAG001d67c74 [2018-11-28 13:05:07,429 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/data/c1ffd5f56/9787ddc64eab4eb589ae2a5677766f49 [2018-11-28 13:05:07,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:05:07,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:05:07,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:05:07,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:05:07,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:05:07,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23acc025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07, skipping insertion in model container [2018-11-28 13:05:07,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:05:07,467 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:05:07,631 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:05:07,639 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:05:07,713 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:05:07,735 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:05:07,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07 WrapperNode [2018-11-28 13:05:07,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:05:07,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:05:07,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:05:07,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:05:07,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:05:07,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:05:07,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:05:07,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:05:07,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... [2018-11-28 13:05:07,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:05:07,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:05:07,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:05:07,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:05:07,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:05:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:05:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:05:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:05:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:05:07,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:05:07,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:05:07,998 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:05:07,998 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:05:07,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:05:07 BoogieIcfgContainer [2018-11-28 13:05:07,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:05:07,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:05:07,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:05:08,002 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:05:08,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:05:08,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:05:07" (1/3) ... [2018-11-28 13:05:08,003 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:05:08, skipping insertion in model container [2018-11-28 13:05:08,003 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:05:08,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:05:07" (2/3) ... [2018-11-28 13:05:08,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:05:08, skipping insertion in model container [2018-11-28 13:05:08,004 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:05:08,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:05:07" (3/3) ... [2018-11-28 13:05:08,006 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-28 13:05:08,054 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:05:08,055 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:05:08,055 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:05:08,055 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:05:08,055 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:05:08,055 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:05:08,055 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:05:08,055 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:05:08,055 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:05:08,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 13:05:08,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:05:08,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:08,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:08,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:05:08,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:05:08,094 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:05:08,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 13:05:08,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:05:08,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:08,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:08,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:05:08,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:05:08,103 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L555-3true [2018-11-28 13:05:08,103 INFO L796 eck$LassoCheckResult]: Loop: 6#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 13#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L557-3true assume !true; 4#L557-4true call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 6#L555-3true [2018-11-28 13:05:08,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,108 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 13:05:08,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-28 13:05:08,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:05:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:05:08,249 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:05:08,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:05:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:05:08,261 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-28 13:05:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:05:08,265 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-28 13:05:08,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:05:08,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 13:05:08,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:05:08,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-28 13:05:08,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 13:05:08,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 13:05:08,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 13:05:08,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:05:08,273 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 13:05:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 13:05:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 13:05:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 13:05:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 13:05:08,296 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 13:05:08,296 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 13:05:08,296 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:05:08,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 13:05:08,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:05:08,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:08,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:08,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:05:08,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:05:08,298 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-11-28 13:05:08,298 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 36#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 38#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 34#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 33#L555-3 [2018-11-28 13:05:08,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 13:05:08,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-28 13:05:08,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-28 13:05:08,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:08,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:05:08,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:05:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:05:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:05:08,556 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-28 13:05:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:05:08,616 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-28 13:05:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:05:08,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 13:05:08,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:05:08,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 13:05:08,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:05:08,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 13:05:08,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-28 13:05:08,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:05:08,619 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 13:05:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-28 13:05:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 13:05:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 13:05:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 13:05:08,620 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 13:05:08,620 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 13:05:08,620 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:05:08,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-28 13:05:08,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:05:08,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:08,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:08,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:05:08,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 13:05:08,621 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 62#L555-3 [2018-11-28 13:05:08,621 INFO L796 eck$LassoCheckResult]: Loop: 62#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 65#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 68#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 66#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 67#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 69#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 63#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 62#L555-3 [2018-11-28 13:05:08,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 13:05:08,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2018-11-28 13:05:08,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:08,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2018-11-28 13:05:08,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:08,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:08,977 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-28 13:05:09,058 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:05:09,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:05:09,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:05:09,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:05:09,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:05:09,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:05:09,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:05:09,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:05:09,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 13:05:09,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:05:09,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:05:09,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,263 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-11-28 13:05:09,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:09,625 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:05:09,629 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:05:09,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:09,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:09,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:09,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:09,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:09,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:09,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:09,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:09,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:09,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:09,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:09,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:09,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,682 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:05:09,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,684 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:05:09,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,697 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:05:09,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,699 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:05:09,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:09,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:09,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:09,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:09,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:09,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:09,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:09,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:09,740 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:05:09,745 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:05:09,745 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:05:09,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:05:09,748 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:05:09,748 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:05:09,749 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-28 13:05:09,819 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 13:05:09,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:05:09,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:09,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:09,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:09,897 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 26 treesize of output 36 [2018-11-28 13:05:09,902 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 27 treesize of output 26 [2018-11-28 13:05:09,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:09,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:09,931 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-28 13:05:09,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:05:09,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:09,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:09,959 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-11-28 13:05:09,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:09,979 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 34 treesize of output 37 [2018-11-28 13:05:09,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:09,985 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 28 treesize of output 7 [2018-11-28 13:05:09,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:09,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:10,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:10,014 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 55 [2018-11-28 13:05:10,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:10,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:10,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:10,023 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 41 treesize of output 37 [2018-11-28 13:05:10,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:10,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:10,050 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 36 treesize of output 26 [2018-11-28 13:05:10,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:10,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:10,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:10,077 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:22 [2018-11-28 13:05:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:10,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 13:05:10,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-28 13:05:10,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 23 states and 26 transitions. Complement of second has 13 states. [2018-11-28 13:05:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 13:05:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 13:05:10,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 13:05:10,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:10,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 13:05:10,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:10,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 13:05:10,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:10,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-28 13:05:10,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:05:10,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2018-11-28 13:05:10,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 13:05:10,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:05:10,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-28 13:05:10,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:05:10,243 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 13:05:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-28 13:05:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 13:05:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 13:05:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 13:05:10,244 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:05:10,244 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:05:10,245 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:05:10,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 13:05:10,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:05:10,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:10,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:10,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:05:10,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 13:05:10,246 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 239#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 240#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 248#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 258#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 249#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 250#L557-3 [2018-11-28 13:05:10,246 INFO L796 eck$LassoCheckResult]: Loop: 250#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 253#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 256#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 255#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 241#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 242#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 246#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 250#L557-3 [2018-11-28 13:05:10,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:10,246 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-28 13:05:10,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:10,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:10,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 2 times [2018-11-28 13:05:10,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:10,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:10,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 2 times [2018-11-28 13:05:10,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:10,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:10,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:10,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:10,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:10,650 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-28 13:05:10,727 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:05:10,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:05:10,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:05:10,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:05:10,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:05:10,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:05:10,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:05:10,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:05:10,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-28 13:05:10,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:05:10,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:05:10,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:10,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:11,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:05:11,229 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:05:11,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:11,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:11,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:11,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:11,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:11,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:11,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:11,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:11,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:11,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:11,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:11,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:11,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:11,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:11,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:11,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:11,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:11,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:11,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:11,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:11,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:11,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:11,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:11,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:11,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:11,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:11,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:11,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:11,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:11,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:11,292 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:05:11,309 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 13:05:11,309 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:05:11,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:05:11,311 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:05:11,312 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:05:11,312 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 [] [2018-11-28 13:05:11,399 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 13:05:11,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:05:11,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:11,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:11,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:11,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,469 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 [2018-11-28 13:05:11,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,476 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 45 treesize of output 36 [2018-11-28 13:05:11,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:11,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,503 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 30 treesize of output 47 [2018-11-28 13:05:11,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:11,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:11,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:11,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:50 [2018-11-28 13:05:11,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,605 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 51 treesize of output 50 [2018-11-28 13:05:11,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,611 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 46 treesize of output 33 [2018-11-28 13:05:11,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:11,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:11,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,639 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 54 treesize of output 49 [2018-11-28 13:05:11,642 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:05:11,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:11,644 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 54 [2018-11-28 13:05:11,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:11,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:11,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:11,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:61 [2018-11-28 13:05:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:11,739 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 [2018-11-28 13:05:11,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 13:05:11,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 51 states and 58 transitions. Complement of second has 17 states. [2018-11-28 13:05:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 13:05:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-28 13:05:11,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-28 13:05:11,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:11,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-28 13:05:11,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:11,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-28 13:05:11,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:11,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2018-11-28 13:05:11,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:05:11,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 43 states and 50 transitions. [2018-11-28 13:05:11,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:05:11,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 13:05:11,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-11-28 13:05:11,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:05:11,884 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-28 13:05:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-11-28 13:05:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-11-28 13:05:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 13:05:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-28 13:05:11,886 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 13:05:11,886 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 13:05:11,886 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:05:11,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-28 13:05:11,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:05:11,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:11,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:11,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-28 13:05:11,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:05:11,887 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 486#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 487#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 494#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 500#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 518#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 516#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L557-1 [2018-11-28 13:05:11,888 INFO L796 eck$LassoCheckResult]: Loop: 496#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 497#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L557-1 [2018-11-28 13:05:11,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907812, now seen corresponding path program 2 times [2018-11-28 13:05:11,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:11,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:11,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:11,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:11,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 1 times [2018-11-28 13:05:11,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:11,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:11,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:11,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:11,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:11,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 3 times [2018-11-28 13:05:11,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:11,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:11,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:05:11,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:12,282 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-11-28 13:05:12,371 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:05:12,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:05:12,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:05:12,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:05:12,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:05:12,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:05:12,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:05:12,372 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:05:12,372 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-28 13:05:12,372 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:05:12,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:05:12,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,565 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 13:05:12,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:12,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:05:12,885 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:05:12,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:12,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:12,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:12,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:12,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:12,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:12,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:12,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,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 [2018-11-28 13:05:12,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:12,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:12,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,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 [2018-11-28 13:05:12,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:12,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:12,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:12,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:12,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:05:12,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:05:12,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:05:12,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:12,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:12,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:12,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:12,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:12,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:12,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:12,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:12,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:12,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:12,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:12,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:12,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:12,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:12,923 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:05:12,937 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:05:12,937 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:05:12,937 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:05:12,938 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 13:05:12,938 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:05:12,939 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)_3, ULTIMATE.start_test_fun_#t~mem7) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem7 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem6 >= 0] [2018-11-28 13:05:13,021 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-11-28 13:05:13,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:05:13,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:13,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:13,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:13,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,072 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 31 treesize of output 49 [2018-11-28 13:05:13,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,076 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 38 treesize of output 29 [2018-11-28 13:05:13,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:05:13,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:13,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:05:13,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,119 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 13:05:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:13,127 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:05:13,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 13:05:13,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 48 states and 56 transitions. Complement of second has 5 states. [2018-11-28 13:05:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:05:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 13:05:13,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 13:05:13,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:13,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 13:05:13,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:13,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 13:05:13,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:13,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-28 13:05:13,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:05:13,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 48 transitions. [2018-11-28 13:05:13,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 13:05:13,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:05:13,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-11-28 13:05:13,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:05:13,156 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-28 13:05:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-11-28 13:05:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-11-28 13:05:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 13:05:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-28 13:05:13,159 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-28 13:05:13,159 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-28 13:05:13,159 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:05:13,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-11-28 13:05:13,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:05:13,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:13,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:13,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 13:05:13,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 13:05:13,160 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 727#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 735#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 751#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 749#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 746#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 745#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 744#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 743#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 742#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 740#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 739#L557-3 [2018-11-28 13:05:13,160 INFO L796 eck$LassoCheckResult]: Loop: 739#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 738#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 737#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 736#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 722#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 723#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 741#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 739#L557-3 [2018-11-28 13:05:13,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:13,161 INFO L82 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 3 times [2018-11-28 13:05:13,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:13,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:13,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:13,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:13,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:05:13,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70345407-b457-40a0-9cf6-78ec067501b3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:05:13,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:05:13,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 13:05:13,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:05:13,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:13,315 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 [2018-11-28 13:05:13,317 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 [2018-11-28 13:05:13,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 13:05:13,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,343 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 [2018-11-28 13:05:13,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2018-11-28 13:05:13,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-28 13:05:13,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,430 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 36 treesize of output 52 [2018-11-28 13:05:13,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,437 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 43 treesize of output 34 [2018-11-28 13:05:13,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:13,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 47 [2018-11-28 13:05:13,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:13,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:05:13,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:05:13,516 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-11-28 13:05:13,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:05:13,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:05:13,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:13,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:44, output treesize:3 [2018-11-28 13:05:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:13,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:05:13,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-28 13:05:13,593 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:05:13,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 3 times [2018-11-28 13:05:13,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:13,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:05:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:05:13,675 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-28 13:05:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:05:13,790 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-28 13:05:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:05:13,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 36 transitions. [2018-11-28 13:05:13,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:05:13,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 22 states and 24 transitions. [2018-11-28 13:05:13,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 13:05:13,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:05:13,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-28 13:05:13,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:05:13,791 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 13:05:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-28 13:05:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-11-28 13:05:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:05:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 13:05:13,792 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:05:13,793 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:05:13,793 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:05:13,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 13:05:13,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:05:13,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:13,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:13,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 13:05:13,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:05:13,793 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 849#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 850#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 854#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 860#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 865#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 859#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 862#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 864#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 863#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 851#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 852#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 855#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 861#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L557-1 [2018-11-28 13:05:13,794 INFO L796 eck$LassoCheckResult]: Loop: 856#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 857#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L557-1 [2018-11-28 13:05:13,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -300113017, now seen corresponding path program 4 times [2018-11-28 13:05:13,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 2 times [2018-11-28 13:05:13,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:13,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 5 times [2018-11-28 13:05:13,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:13,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:13,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:15,181 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2018-11-28 13:05:15,352 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-28 13:05:15,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:05:15,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:05:15,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:05:15,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:05:15,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:05:15,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:05:15,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:05:15,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:05:15,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-28 13:05:15,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:05:15,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:05:15,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:15,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:05:15,884 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:05:15,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:15,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:15,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:15,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:15,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:15,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:15,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:15,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:15,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 [2018-11-28 13:05:15,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:15,888 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:05:15,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:15,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:15,889 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:05:15,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:15,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:15,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:15,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:15,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:15,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:15,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:15,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:15,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:15,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:05:15,913 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:05:15,913 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:05:15,913 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:05:15,914 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 13:05:15,914 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:05:15,915 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7) = -1*ULTIMATE.start_test_fun_#t~mem6 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 1 >= 0] [2018-11-28 13:05:15,978 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 13:05:16,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:16,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:16,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,042 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 17 treesize of output 29 [2018-11-28 13:05:16,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 13:05:16,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 13:05:16,074 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 [2018-11-28 13:05:16,075 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 [2018-11-28 13:05:16,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 13:05:16,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 13:05:16,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,096 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 28 treesize of output 7 [2018-11-28 13:05:16,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 13:05:16,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 13:05:16,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,125 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 28 treesize of output 7 [2018-11-28 13:05:16,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 13:05:16,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,172 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 [2018-11-28 13:05:16,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,174 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 [2018-11-28 13:05:16,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 13:05:16,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,198 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 32 treesize of output 35 [2018-11-28 13:05:16,199 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 31 treesize of output 15 [2018-11-28 13:05:16,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-28 13:05:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:16,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:16,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,234 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 31 treesize of output 49 [2018-11-28 13:05:16,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,238 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 38 treesize of output 29 [2018-11-28 13:05:16,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:05:16,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:16,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,270 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 13:05:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:16,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-11-28 13:05:16,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 13:05:16,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 18 states and 20 transitions. Complement of second has 5 states. [2018-11-28 13:05:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 13:05:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-28 13:05:16,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 13:05:16,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:16,304 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:05:16,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:16,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:16,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 13:05:16,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 13:05:16,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 13:05:16,369 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 [2018-11-28 13:05:16,370 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 [2018-11-28 13:05:16,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 13:05:16,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 13:05:16,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,387 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 28 treesize of output 7 [2018-11-28 13:05:16,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 13:05:16,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 13:05:16,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,408 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 28 treesize of output 7 [2018-11-28 13:05:16,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 13:05:16,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-28 13:05:16,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,456 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 [2018-11-28 13:05:16,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 13:05:16,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-11-28 13:05:16,481 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 31 treesize of output 15 [2018-11-28 13:05:16,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-28 13:05:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:16,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:16,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,514 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 31 treesize of output 49 [2018-11-28 13:05:16,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-11-28 13:05:16,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:16,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,544 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 24 treesize of output 25 [2018-11-28 13:05:16,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 13:05:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:16,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2018-11-28 13:05:16,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 13:05:16,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 18 states and 20 transitions. Complement of second has 5 states. [2018-11-28 13:05:16,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 13:05:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-28 13:05:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 13:05:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:16,586 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:05:16,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:16,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:16,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,618 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 17 treesize of output 29 [2018-11-28 13:05:16,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 13:05:16,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 13:05:16,650 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 [2018-11-28 13:05:16,651 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 [2018-11-28 13:05:16,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 13:05:16,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 13:05:16,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,667 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 28 treesize of output 7 [2018-11-28 13:05:16,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 13:05:16,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,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, 2 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 [2018-11-28 13:05:16,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,684 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 28 treesize of output 7 [2018-11-28 13:05:16,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 13:05:16,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,723 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 [2018-11-28 13:05:16,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,726 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 [2018-11-28 13:05:16,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 13:05:16,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,749 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 32 treesize of output 35 [2018-11-28 13:05:16,751 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 31 treesize of output 15 [2018-11-28 13:05:16,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-28 13:05:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:16,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:16,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,783 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 31 treesize of output 49 [2018-11-28 13:05:16,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,785 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 38 treesize of output 29 [2018-11-28 13:05:16,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:05:16,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:16,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:16,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 13:05:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:16,824 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-11-28 13:05:16,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 13:05:16,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 49 states and 57 transitions. Complement of second has 22 states. [2018-11-28 13:05:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-28 13:05:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 13:05:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-11-28 13:05:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 13:05:16,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 13:05:16,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:16,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 13:05:16,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:16,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-11-28 13:05:16,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:05:16,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 41 transitions. [2018-11-28 13:05:16,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:05:16,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 13:05:16,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-11-28 13:05:16,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:05:16,914 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 13:05:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-11-28 13:05:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2018-11-28 13:05:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 13:05:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-28 13:05:16,916 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 13:05:16,916 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 13:05:16,916 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:05:16,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-28 13:05:16,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:05:16,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:05:16,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:05:16,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 1, 1, 1, 1] [2018-11-28 13:05:16,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:05:16,917 INFO L794 eck$LassoCheckResult]: Stem: 1292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1288#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1289#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1293#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1302#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1295#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1296#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1304#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1305#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1310#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1300#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1301#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1290#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1291#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1294#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1303#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1299#L557-1 [2018-11-28 13:05:16,918 INFO L796 eck$LassoCheckResult]: Loop: 1299#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1298#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1299#L557-1 [2018-11-28 13:05:16,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash 883958124, now seen corresponding path program 6 times [2018-11-28 13:05:16,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:16,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:16,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:16,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:16,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:16,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 3 times [2018-11-28 13:05:16,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:16,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:16,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:16,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash -919766745, now seen corresponding path program 7 times [2018-11-28 13:05:16,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:05:16,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:05:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:16,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:05:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:05:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:05:18,692 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 182 DAG size of output: 163 [2018-11-28 13:05:18,836 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-28 13:05:18,838 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:05:18,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:05:18,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:05:18,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:05:18,838 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:05:18,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:05:18,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:05:18,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:05:18,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-28 13:05:18,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:05:18,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:05:18,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:05:19,276 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:05:19,276 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:05:19,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:19,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:19,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:19,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:19,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:19,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:19,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:19,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:19,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:19,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:19,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:19,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:19,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:19,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:19,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:19,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:19,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:19,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:19,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:19,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:19,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:19,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:19,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:19,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:19,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:19,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:19,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:19,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:19,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:19,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:19,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:19,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:19,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:19,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:19,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:19,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:19,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:19,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:19,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:19,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:05:19,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:05:19,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:05:19,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:05:19,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:05:19,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:05:19,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:05:19,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:05:19,303 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:05:19,310 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:05:19,310 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:05:19,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:05:19,311 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 13:05:19,311 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:05:19,311 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, ULTIMATE.start_test_fun_#t~mem7) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem7 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem6 >= 0] [2018-11-28 13:05:19,362 INFO L297 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2018-11-28 13:05:19,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:05:19,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:19,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:19,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:19,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,406 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 31 treesize of output 49 [2018-11-28 13:05:19,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,411 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 38 treesize of output 29 [2018-11-28 13:05:19,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:19,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:05:19,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:19,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:05:19,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:19,450 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 13:05:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:19,457 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:05:19,458 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:05:19,477 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 34 states and 40 transitions. Complement of second has 5 states. [2018-11-28 13:05:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:05:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 13:05:19,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 13:05:19,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:19,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:05:19,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:19,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:19,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:19,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,536 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 31 treesize of output 49 [2018-11-28 13:05:19,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,539 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 38 treesize of output 29 [2018-11-28 13:05:19,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:19,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:05:19,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:19,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:05:19,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:19,580 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 13:05:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:19,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:05:19,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:05:19,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 34 states and 40 transitions. Complement of second has 5 states. [2018-11-28 13:05:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:05:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 13:05:19,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 13:05:19,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:19,606 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:05:19,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:05:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:19,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:05:19,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:05:19,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,661 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 31 treesize of output 49 [2018-11-28 13:05:19,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,664 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 38 treesize of output 29 [2018-11-28 13:05:19,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:05:19,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:05:19,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:05:19,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 13:05:19,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:05:19,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:05:19,708 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 13:05:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:05:19,716 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 2 loop predicates [2018-11-28 13:05:19,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:05:19,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 39 states and 47 transitions. Complement of second has 4 states. [2018-11-28 13:05:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:05:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:05:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 13:05:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 13:05:19,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-28 13:05:19,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 13:05:19,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:05:19,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-28 13:05:19,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:05:19,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-28 13:05:19,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:05:19,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:05:19,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:05:19,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:05:19,747 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:05:19,748 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:05:19,748 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:05:19,748 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 13:05:19,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:05:19,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:05:19,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:05:19,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:05:19 BoogieIcfgContainer [2018-11-28 13:05:19,752 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:05:19,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:05:19,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:05:19,753 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:05:19,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:05:07" (3/4) ... [2018-11-28 13:05:19,755 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:05:19,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:05:19,756 INFO L168 Benchmark]: Toolchain (without parser) took 12324.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 950.6 MB in the beginning and 807.2 MB in the end (delta: 143.5 MB). Peak memory consumption was 489.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:05:19,757 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:05:19,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:05:19,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.10 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:05:19,757 INFO L168 Benchmark]: Boogie Preprocessor took 15.95 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. [2018-11-28 13:05:19,758 INFO L168 Benchmark]: RCFGBuilder took 216.41 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:05:19,758 INFO L168 Benchmark]: BuchiAutomizer took 11752.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 807.2 MB in the end (delta: 284.0 MB). Peak memory consumption was 503.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:05:19,758 INFO L168 Benchmark]: Witness Printer took 3.17 ms. Allocated memory is still 1.4 GB. Free memory is still 807.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:05:19,760 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.10 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.95 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 216.41 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11752.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 807.2 MB in the end (delta: 284.0 MB). Peak memory consumption was 503.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.17 ms. Allocated memory is still 1.4 GB. Free memory is still 807.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + aux-x_ref-aux and consists of 3 locations. One nondeterministic module has affine ranking function -1 * aux-y_ref-aux + aux-x_ref-aux and consists of 12 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + aux-x_ref-aux and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 9.0s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/4 HoareTripleCheckerStatistics: 57 SDtfs, 70 SDslu, 27 SDs, 0 SdLazy, 337 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital729 mio100 ax103 hnf100 lsp95 ukn33 mio100 lsp36 div100 bol100 ite100 ukn100 eq181 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...