./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-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_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:47:35,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:47:35,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:47:35,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:47:35,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:47:35,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:47:35,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:47:35,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:47:35,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:47:35,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:47:35,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:47:35,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:47:35,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:47:35,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:47:35,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:47:35,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:47:35,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:47:35,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:47:35,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:47:35,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:47:35,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:47:35,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:47:35,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:47:35,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:47:35,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:47:35,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:47:35,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:47:35,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:47:35,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:47:35,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:47:35,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:47:35,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:47:35,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:47:35,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:47:35,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:47:35,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:47:35,311 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 10:47:35,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:47:35,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:47:35,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:47:35,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:47:35,324 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:47:35,324 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:47:35,324 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:47:35,324 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:47:35,324 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:47:35,324 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:47:35,324 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:47:35,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:47:35,325 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:47:35,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:47:35,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:47:35,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:47:35,326 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:47:35,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:47:35,326 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:47:35,326 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:47:35,327 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:47:35,327 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_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2018-11-28 10:47:35,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:47:35,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:47:35,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:47:35,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:47:35,362 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:47:35,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 10:47:35,404 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/data/321285ff5/18abc5a961a24afb85202c8bb63e3b20/FLAG08f0ab0ea [2018-11-28 10:47:35,784 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:47:35,784 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 10:47:35,795 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/data/321285ff5/18abc5a961a24afb85202c8bb63e3b20/FLAG08f0ab0ea [2018-11-28 10:47:36,167 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/data/321285ff5/18abc5a961a24afb85202c8bb63e3b20 [2018-11-28 10:47:36,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:47:36,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:47:36,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:47:36,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:47:36,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:47:36,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4027bc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36, skipping insertion in model container [2018-11-28 10:47:36,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:47:36,207 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:47:36,393 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:47:36,404 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:47:36,481 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:47:36,504 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:47:36,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36 WrapperNode [2018-11-28 10:47:36,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:47:36,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:47:36,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:47:36,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:47:36,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:47:36,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:47:36,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:47:36,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:47:36,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... [2018-11-28 10:47:36,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:47:36,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:47:36,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:47:36,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:47:36,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/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 10:47:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:47:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:47:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:47:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:47:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:47:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:47:36,766 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:47:36,766 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 10:47:36,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:47:36 BoogieIcfgContainer [2018-11-28 10:47:36,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:47:36,767 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:47:36,767 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:47:36,770 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:47:36,770 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:47:36,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:47:36" (1/3) ... [2018-11-28 10:47:36,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@522fcd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:47:36, skipping insertion in model container [2018-11-28 10:47:36,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:47:36,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:47:36" (2/3) ... [2018-11-28 10:47:36,772 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@522fcd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:47:36, skipping insertion in model container [2018-11-28 10:47:36,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:47:36,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:47:36" (3/3) ... [2018-11-28 10:47:36,773 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 10:47:36,817 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:47:36,817 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:47:36,817 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:47:36,818 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:47:36,818 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:47:36,818 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:47:36,818 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:47:36,818 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:47:36,818 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:47:36,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 10:47:36,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:36,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:47:36,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:47:36,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:47:36,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:47:36,847 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:47:36,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 10:47:36,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:36,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:47:36,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:47:36,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 10:47:36,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:47:36,855 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 7#L558-3true [2018-11-28 10:47:36,856 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2018-11-28 10:47:36,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:36,861 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-11-28 10:47:36,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:36,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:36,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:36,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:36,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2018-11-28 10:47:36,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:36,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:36,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2018-11-28 10:47:36,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:37,462 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-11-28 10:47:37,565 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:47:37,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:47:37,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:47:37,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:47:37,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:47:37,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:47:37,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:47:37,567 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:47:37,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 10:47:37,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:47:37,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:47:37,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 10:47:37,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 10:47:37,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 10:47:37,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 10:47:37,594 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 10:47:37,595 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 10:47:37,598 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 10:47:37,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:47:37,602 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 10:47:37,604 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 10:47:37,606 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 10:47:37,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:47:37,609 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 10:47:37,611 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 10:47:37,612 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 10:47:37,614 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 10:47:37,835 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-28 10:47:37,906 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 10:47:37,908 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 10:47:37,909 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 10:47:37,910 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 10:47:37,911 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 10:47:37,913 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 10:47:38,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:47:38,259 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:47:38,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,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 10:47:38,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,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 10:47:38,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:38,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:38,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:38,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:38,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:38,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:38,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:38,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:38,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:38,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,326 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:47:38,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,328 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:47:38,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:38,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,355 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:47:38,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,357 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:47:38,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:38,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:38,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:38,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:38,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:38,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:38,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:38,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:38,373 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:47:38,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:38,380 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 10:47:38,380 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 10:47:38,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:47:38,476 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:47:38,476 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 10:47:38,479 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:47:38,481 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 10:47:38,481 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:47:38,482 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)_1, 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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 10:47:38,547 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 10:47:38,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:47:38,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:47:38,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:38,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:38,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-11-28 10:47:38,625 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 10:47:38,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-28 10:47:38,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-28 10:47:38,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 10:47:38,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 21 [2018-11-28 10:47:38,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 10:47:38,747 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,751 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 23 [2018-11-28 10:47:38,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 10:47:38,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,767 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-28 10:47:38,802 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 24 treesize of output 17 [2018-11-28 10:47:38,802 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,812 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 17 treesize of output 12 [2018-11-28 10:47:38,813 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 10:47:38,826 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,836 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:38,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:38,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:38,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,893 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:71, output treesize:10 [2018-11-28 10:47:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:38,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:38,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:38,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-11-28 10:47:38,944 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 49 treesize of output 42 [2018-11-28 10:47:38,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:38,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:38,964 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 32 treesize of output 45 [2018-11-28 10:47:38,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:38,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:38,984 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:50 [2018-11-28 10:47:39,002 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 10:47:39,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 10:47:39,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-11-28 10:47:39,073 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2018-11-28 10:47:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:47:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 10:47:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-28 10:47:39,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 10:47:39,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:39,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 10:47:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:39,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 10:47:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:39,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-11-28 10:47:39,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:39,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2018-11-28 10:47:39,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:47:39,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 10:47:39,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-11-28 10:47:39,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:47:39,084 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-28 10:47:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-11-28 10:47:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-28 10:47:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 10:47:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 10:47:39,104 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 10:47:39,104 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 10:47:39,104 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:47:39,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 10:47:39,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:39,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:47:39,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:47:39,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:47:39,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 10:47:39,105 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-11-28 10:47:39,106 INFO L796 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-11-28 10:47:39,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2018-11-28 10:47:39,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:39,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:39,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:39,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:39,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:39,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2018-11-28 10:47:39,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:39,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2018-11-28 10:47:39,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:39,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:39,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:39,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:39,442 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2018-11-28 10:47:39,511 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:47:39,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:47:39,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:47:39,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:47:39,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:47:39,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:47:39,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:47:39,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:47:39,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 10:47:39,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:47:39,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:47:39,514 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 10:47:39,516 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 10:47:39,517 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 10:47:39,519 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 10:47:39,521 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 10:47:39,522 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 10:47:39,711 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-28 10:47:39,787 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 10:47:39,788 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 10:47:39,789 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 10:47:39,790 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 10:47:39,791 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 10:47:39,792 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 10:47:39,793 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 10:47:39,794 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 10:47:39,795 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 10:47:39,796 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 10:47:39,797 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 10:47:39,798 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 10:47:39,799 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 10:47:39,800 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 10:47:39,802 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 10:47:40,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:47:40,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:47:40,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:40,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:40,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:40,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:40,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:40,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:40,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:40,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:40,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:40,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:40,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:40,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:40,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,133 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:47:40,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,134 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:47:40,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,138 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:47:40,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,146 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:47:40,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:40,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:40,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,159 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:47:40,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:47:40,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:40,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:40,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:40,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:40,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:40,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:40,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:40,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:40,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:40,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:40,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:47:40,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:40,187 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 10:47:40,187 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 10:47:40,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:47:40,259 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 10:47:40,260 INFO L444 ModelExtractionUtils]: 43 out of 51 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 10:47:40,260 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:47:40,262 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 10:47:40,262 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:47:40,262 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 10:47:40,367 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 10:47:40,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:47:40,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:40,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:40,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:40,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-11-28 10:47:40,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-28 10:47:40,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2018-11-28 10:47:40,451 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 10:47:40,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-28 10:47:40,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 10:47:40,508 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:40,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-28 10:47:40,549 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 10:47:40,581 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 10:47:40,581 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,587 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 5 treesize of output 1 [2018-11-28 10:47:40,587 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,592 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-28 10:47:40,628 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 19 treesize of output 12 [2018-11-28 10:47:40,628 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 10:47:40,645 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:40,657 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:40,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 21 [2018-11-28 10:47:40,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 10:47:40,686 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,690 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:40,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:40,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:40,743 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2018-11-28 10:47:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:40,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:40,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:40,780 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 32 treesize of output 33 [2018-11-28 10:47:40,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:40,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 10:47:40,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 10:47:40,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:40,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 10:47:40,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:40,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 10:47:40,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:40,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-28 10:47:40,828 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 10:47:40,828 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 10:47:40,828 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 10:47:40,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2018-11-28 10:47:40,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:47:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 10:47:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 10:47:40,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 10:47:40,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:40,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 10:47:40,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:40,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 10:47:40,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:40,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-28 10:47:40,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:40,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2018-11-28 10:47:40,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:47:40,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:47:40,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-28 10:47:40,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:47:40,882 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 10:47:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-28 10:47:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 10:47:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 10:47:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-28 10:47:40,884 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 10:47:40,884 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 10:47:40,884 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:47:40,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-28 10:47:40,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:40,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:47:40,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:47:40,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:47:40,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 10:47:40,886 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-11-28 10:47:40,886 INFO L796 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-11-28 10:47:40,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:40,886 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2018-11-28 10:47:40,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:40,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:40,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:40,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:40,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2018-11-28 10:47:40,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:40,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:47:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:40,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2018-11-28 10:47:40,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:40,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:40,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:47:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:41,471 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2018-11-28 10:47:41,626 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-28 10:47:41,628 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:47:41,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:47:41,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:47:41,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:47:41,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:47:41,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:47:41,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:47:41,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:47:41,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 10:47:41,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:47:41,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:47:41,631 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 10:47:41,634 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 10:47:41,636 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 10:47:41,639 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 10:47:41,644 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 10:47:41,645 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 10:47:41,647 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 10:47:41,649 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 10:47:41,650 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 10:47:41,656 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 10:47:41,658 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 10:47:41,658 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 10:47:41,659 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 10:47:41,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:47:41,851 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-28 10:47:41,926 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 10:47:41,928 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 10:47:41,928 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 10:47:41,930 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 10:47:41,930 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 10:47:41,931 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 10:47:41,932 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 10:47:41,936 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 10:47:42,193 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:47:42,193 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:47:42,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:47:42,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:47:42,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:47:42,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:47:42,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,233 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:47:42,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,234 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:47:42,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,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 10:47:42,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:47:42,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 10:47:42,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:47:42,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:47:42,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:47:42,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:47:42,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:47:42,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:47:42,256 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:47:42,264 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 10:47:42,264 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 10:47:42,265 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:47:42,265 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:47:42,265 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:47:42,265 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-28 10:47:42,328 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 10:47:42,330 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:47:42,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:42,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:42,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-28 10:47:42,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-28 10:47:42,388 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 10:47:42,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-28 10:47:42,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-28 10:47:42,419 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 10:47:42,459 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:42,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2018-11-28 10:47:42,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-11-28 10:47:42,539 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-28 10:47:42,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2018-11-28 10:47:42,619 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:42,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 10:47:42,675 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 10:47:42,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-28 10:47:42,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 10:47:42,799 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,817 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:47:42,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-28 10:47:42,818 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,829 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:42,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2018-11-28 10:47:42,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-28 10:47:42,903 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:42,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-11-28 10:47:42,964 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-11-28 10:47:43,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-28 10:47:43,013 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 10:47:43,064 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:43,102 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 10:47:43,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-28 10:47:43,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-28 10:47:43,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-28 10:47:43,202 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:74, output treesize:85 [2018-11-28 10:47:43,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2018-11-28 10:47:43,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 22 [2018-11-28 10:47:43,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,330 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 29 treesize of output 22 [2018-11-28 10:47:43,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-11-28 10:47:43,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:43,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 10:47:43,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 18 [2018-11-28 10:47:43,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 10:47:43,575 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-28 10:47:43,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 19 [2018-11-28 10:47:43,667 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-28 10:47:43,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 10:47:43,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:43,730 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:30, output treesize:30 [2018-11-28 10:47:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:43,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:43,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,772 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 32 treesize of output 33 [2018-11-28 10:47:43,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:43,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 10:47:43,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:43,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 10:47:43,807 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 10:47:43,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2018-11-28 10:47:43,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-28 10:47:43,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2018-11-28 10:47:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:47:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 10:47:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-28 10:47:43,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 10:47:43,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:43,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-28 10:47:43,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:43,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-28 10:47:43,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:47:43,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2018-11-28 10:47:43,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:43,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2018-11-28 10:47:43,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:47:43,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:47:43,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-11-28 10:47:43,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:47:43,942 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 10:47:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-11-28 10:47:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-11-28 10:47:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 10:47:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-28 10:47:43,945 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 10:47:43,945 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 10:47:43,945 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:47:43,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-28 10:47:43,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:43,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:47:43,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:47:43,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 10:47:43,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 10:47:43,948 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-11-28 10:47:43,948 INFO L796 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-11-28 10:47:43,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:43,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2018-11-28 10:47:43,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:43,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:47:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:47:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:47:44,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/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 10:47:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 10:47:44,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 10:47:44,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:47:44,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:44,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:44,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:47:44,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:44,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:44,199 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 10:47:44,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-28 10:47:44,223 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 10:47:44,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-28 10:47:44,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-28 10:47:44,246 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-28 10:47:44,277 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 45 [2018-11-28 10:47:44,316 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 34 treesize of output 33 [2018-11-28 10:47:44,316 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,330 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,356 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 22 treesize of output 23 [2018-11-28 10:47:44,358 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 10:47:44,358 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,363 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2018-11-28 10:47:44,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-28 10:47:44,396 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-28 10:47:44,413 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,422 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,436 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:44,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:44,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 10:47:44,465 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:88, output treesize:70 [2018-11-28 10:47:44,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 10:47:44,508 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 28 treesize of output 27 [2018-11-28 10:47:44,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-28 10:47:44,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:44,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-11-28 10:47:44,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:44,557 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 47 treesize of output 27 [2018-11-28 10:47:44,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:44,577 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 10:47:44,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:47:44,607 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:69 [2018-11-28 10:47:44,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-11-28 10:47:44,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-28 10:47:44,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:44,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-28 10:47:44,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-28 10:47:44,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:47:44,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:17 [2018-11-28 10:47:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:47:44,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:47:44,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 10:47:44,767 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:47:44,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2018-11-28 10:47:44,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:44,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:44,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:47:44,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 10:47:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 10:47:44,862 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-28 10:47:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:47:45,173 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 10:47:45,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:47:45,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-11-28 10:47:45,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:45,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2018-11-28 10:47:45,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:47:45,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 10:47:45,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-28 10:47:45,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:47:45,178 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 10:47:45,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-28 10:47:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-11-28 10:47:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 10:47:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 10:47:45,180 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 10:47:45,180 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 10:47:45,180 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:47:45,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 10:47:45,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:47:45,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:47:45,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:47:45,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:47:45,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 10:47:45,182 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 818#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 819#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 820#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 821#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 825#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 826#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 833#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 829#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 830#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 823#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 824#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 827#L559-2 [2018-11-28 10:47:45,182 INFO L796 eck$LassoCheckResult]: Loop: 827#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 828#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 835#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 834#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 832#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 827#L559-2 [2018-11-28 10:47:45,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2018-11-28 10:47:45,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:45,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:45,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:47:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:47:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:47:45,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:47:45,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffc5f10f-34d3-4e75-a14d-db3cf98a316e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:47:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:47:45,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:47:45,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:47:45,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:47:45,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,377 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 10:47:45,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,395 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 10:47:45,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 10:47:45,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-11-28 10:47:45,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,443 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 10:47:45,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 10:47:45,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-11-28 10:47:45,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:47:45,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 10:47:45,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2018-11-28 10:47:45,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 10:47:45,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 10:47:45,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 10:47:45,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:47:45,526 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-28 10:47:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:47:45,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:47:45,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-28 10:47:45,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:47:45,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:47:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2018-11-28 10:47:45,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:47:45,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:47:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:45,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:47:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:47:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:47:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:47:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:47:45,633 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-28 10:47:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:47:45,688 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-28 10:47:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:47:45,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-28 10:47:45,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:47:45,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-28 10:47:45,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:47:45,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:47:45,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:47:45,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:47:45,689 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:47:45,689 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:47:45,689 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:47:45,689 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:47:45,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:47:45,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:47:45,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:47:45,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:47:45 BoogieIcfgContainer [2018-11-28 10:47:45,693 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:47:45,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:47:45,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:47:45,694 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:47:45,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:47:36" (3/4) ... [2018-11-28 10:47:45,696 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:47:45,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:47:45,697 INFO L168 Benchmark]: Toolchain (without parser) took 9527.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 109.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:47:45,697 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:47:45,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 10:47:45,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.84 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:47:45,698 INFO L168 Benchmark]: Boogie Preprocessor took 18.46 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 10:47:45,698 INFO L168 Benchmark]: RCFGBuilder took 210.74 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.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:47:45,699 INFO L168 Benchmark]: BuchiAutomizer took 8926.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -54.4 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:47:45,699 INFO L168 Benchmark]: Witness Printer took 2.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:47:45,701 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.84 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.46 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 210.74 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.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8926.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -54.4 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.1s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 111 SDslu, 43 SDs, 0 SdLazy, 179 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital551 mio100 ax104 hnf100 lsp93 ukn46 mio100 lsp38 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf101 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 109ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...