./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/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 32bit --witnessprinter.graph.data.programhash ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:01:29,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:01:29,598 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:01:29,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:01:29,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:01:29,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:01:29,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:01:29,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:01:29,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:01:29,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:01:29,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:01:29,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:01:29,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:01:29,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:01:29,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:01:29,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:01:29,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:01:29,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:01:29,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:01:29,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:01:29,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:01:29,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:01:29,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:01:29,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:01:29,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:01:29,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:01:29,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:01:29,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:01:29,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:01:29,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:01:29,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:01:29,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:01:29,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:01:29,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:01:29,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:01:29,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:01:29,628 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 02:01:29,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:01:29,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:01:29,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:01:29,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:01:29,642 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:01:29,642 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:01:29,642 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:01:29,642 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:01:29,642 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:01:29,642 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:01:29,642 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:01:29,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:01:29,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:01:29,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:01:29,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:01:29,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:01:29,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:01:29,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:01:29,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:01:29,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:01:29,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:01:29,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:01:29,644 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:01:29,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:01:29,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:01:29,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:01:29,645 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:01:29,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:01:29,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:01:29,645 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:01:29,646 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:01:29,646 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_c965f258-f70c-4148-8ed3-ca7921122f51/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-11-10 02:01:29,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:01:29,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:01:29,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:01:29,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:01:29,689 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:01:29,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-10 02:01:29,737 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/data/a7a083239/aace10bb53a74725a8ad06636bb5eefa/FLAGea07273ca [2018-11-10 02:01:30,090 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:01:30,090 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-10 02:01:30,095 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/data/a7a083239/aace10bb53a74725a8ad06636bb5eefa/FLAGea07273ca [2018-11-10 02:01:30,108 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/data/a7a083239/aace10bb53a74725a8ad06636bb5eefa [2018-11-10 02:01:30,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:01:30,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:01:30,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:01:30,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:01:30,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:01:30,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2b68c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30, skipping insertion in model container [2018-11-10 02:01:30,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:01:30,151 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:01:30,289 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:01:30,297 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:01:30,311 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:01:30,323 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:01:30,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30 WrapperNode [2018-11-10 02:01:30,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:01:30,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:01:30,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:01:30,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:01:30,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:01:30,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:01:30,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:01:30,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:01:30,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... [2018-11-10 02:01:30,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:01:30,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:01:30,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:01:30,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:01:30,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/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-10 02:01:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 02:01:30,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 02:01:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:01:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:01:30,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:01:30,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:01:30,657 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:01:30,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:01:30 BoogieIcfgContainer [2018-11-10 02:01:30,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:01:30,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:01:30,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:01:30,661 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:01:30,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:01:30,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:01:30" (1/3) ... [2018-11-10 02:01:30,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13bd46e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:01:30, skipping insertion in model container [2018-11-10 02:01:30,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:01:30,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:01:30" (2/3) ... [2018-11-10 02:01:30,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13bd46e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:01:30, skipping insertion in model container [2018-11-10 02:01:30,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:01:30,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:01:30" (3/3) ... [2018-11-10 02:01:30,665 INFO L375 chiAutomizerObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-11-10 02:01:30,712 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:01:30,712 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:01:30,713 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:01:30,713 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:01:30,713 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:01:30,713 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:01:30,713 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:01:30,713 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:01:30,714 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:01:30,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 02:01:30,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 02:01:30,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:30,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:30,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:01:30,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:30,750 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:01:30,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 02:01:30,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 02:01:30,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:30,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:30,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:01:30,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:30,757 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 6#L24-4true [2018-11-10 02:01:30,758 INFO L795 eck$LassoCheckResult]: Loop: 6#L24-4true assume true; 32#L24-1true assume !!(main_~j~0 < 10); 19#L25true SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 16#L25-1true havoc main_#t~nondet4; 20#L26true SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 34#L26-1true havoc main_#t~nondet5; 28#L24-3true main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 6#L24-4true [2018-11-10 02:01:30,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:30,764 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 02:01:30,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:30,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:30,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:30,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1195698039, now seen corresponding path program 1 times [2018-11-10 02:01:30,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:30,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:30,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash 350598791, now seen corresponding path program 1 times [2018-11-10 02:01:30,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:30,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:30,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:31,089 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:01:31,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:01:31,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:01:31,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:01:31,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:01:31,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:01:31,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:01:31,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:01:31,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: test25_false-unreach-call_true-termination.c_Iteration1_Lasso [2018-11-10 02:01:31,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:01:31,091 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:01:31,110 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-10 02:01:31,114 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-10 02:01:31,119 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-10 02:01:31,121 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-10 02:01:31,124 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-10 02:01:31,129 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-10 02:01:31,132 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-10 02:01:31,136 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-10 02:01:31,139 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-10 02:01:31,142 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-10 02:01:31,144 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-10 02:01:31,147 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-10 02:01:31,149 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-10 02:01:31,285 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-10 02:01:31,287 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-10 02:01:31,301 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-10 02:01:31,302 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-10 02:01:31,304 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-10 02:01:31,310 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-10 02:01:31,571 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:01:31,577 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:01:31,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:01:31,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:01:31,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:01:31,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:01:31,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:01:31,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:01:31,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:01:31,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:01:31,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:01:31,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:01:31,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:01:31,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:01:31,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:01:31,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:01:31,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:01:31,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:01:31,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:01:31,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:01:31,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:01:31,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:01:31,698 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:01:31,730 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:01:31,730 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 02:01:31,732 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:01:31,738 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:01:31,738 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:01:31,738 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2018-11-10 02:01:31,761 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 02:01:31,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:31,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:31,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:31,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-10 02:01:31,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:01:31,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 4 states. [2018-11-10 02:01:31,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 4 states. Result 85 states and 100 transitions. Complement of second has 7 states. [2018-11-10 02:01:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:01:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:01:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2018-11-10 02:01:31,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-10 02:01:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:01:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 02:01:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:01:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-10 02:01:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:01:31,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 100 transitions. [2018-11-10 02:01:31,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:31,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 23 states and 25 transitions. [2018-11-10 02:01:31,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 02:01:31,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:31,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-10 02:01:31,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:31,902 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 02:01:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-10 02:01:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 02:01:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 02:01:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-10 02:01:31,923 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 02:01:31,923 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 02:01:31,923 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:01:31,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-10 02:01:31,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:31,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:31,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:31,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:31,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:31,925 INFO L793 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 205#L24-4 assume true; 207#L24-1 assume !(main_~j~0 < 10); 199#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 200#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 197#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 198#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 210#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 211#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 203#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 204#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 214#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 201#L34-4 [2018-11-10 02:01:31,925 INFO L795 eck$LassoCheckResult]: Loop: 201#L34-4 assume true; 202#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 215#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 201#L34-4 [2018-11-10 02:01:31,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1826087895, now seen corresponding path program 1 times [2018-11-10 02:01:31,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:31,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:31,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:31,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:31,955 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-10 02:01:31,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:01:31,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:01:31,958 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 1 times [2018-11-10 02:01:31,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:31,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:31,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:01:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:01:31,990 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 02:01:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:32,004 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-10 02:01:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:01:32,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2018-11-10 02:01:32,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 30 transitions. [2018-11-10 02:01:32,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:32,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:32,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2018-11-10 02:01:32,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:32,006 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-10 02:01:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2018-11-10 02:01:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-11-10 02:01:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 02:01:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 02:01:32,008 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 02:01:32,008 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 02:01:32,008 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:01:32,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-10 02:01:32,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:32,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:32,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:32,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:32,010 INFO L793 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 264#L24-4 assume true; 265#L24-1 assume !!(main_~j~0 < 10); 275#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 276#L25-1 havoc main_#t~nondet4; 254#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 255#L26-1 havoc main_#t~nondet5; 271#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 266#L24-4 assume true; 267#L24-1 assume !(main_~j~0 < 10); 258#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 259#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 256#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 257#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 269#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 270#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 260#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 261#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 273#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 262#L34-4 [2018-11-10 02:01:32,010 INFO L795 eck$LassoCheckResult]: Loop: 262#L34-4 assume true; 263#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 274#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 262#L34-4 [2018-11-10 02:01:32,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 802262675, now seen corresponding path program 1 times [2018-11-10 02:01:32,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:32,060 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/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-10 02:01:32,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:32,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:32,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 02:01:32,122 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:32,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 2 times [2018-11-10 02:01:32,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:01:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:01:32,147 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 02:01:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:32,173 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-10 02:01:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:01:32,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 38 transitions. [2018-11-10 02:01:32,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 37 transitions. [2018-11-10 02:01:32,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:32,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:32,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 37 transitions. [2018-11-10 02:01:32,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:32,180 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 02:01:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 37 transitions. [2018-11-10 02:01:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-10 02:01:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 02:01:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-10 02:01:32,183 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 02:01:32,183 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 02:01:32,183 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:01:32,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2018-11-10 02:01:32,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:32,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:32,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:32,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:32,190 INFO L793 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 389#L24-4 assume true; 390#L24-1 assume !!(main_~j~0 < 10); 408#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 407#L25-1 havoc main_#t~nondet4; 406#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 405#L26-1 havoc main_#t~nondet5; 404#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 391#L24-4 assume true; 392#L24-1 assume !!(main_~j~0 < 10); 402#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 403#L25-1 havoc main_#t~nondet4; 379#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 380#L26-1 havoc main_#t~nondet5; 396#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 397#L24-4 assume true; 401#L24-1 assume !(main_~j~0 < 10); 383#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 384#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 381#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 382#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 394#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 395#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 385#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 386#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 399#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 387#L34-4 [2018-11-10 02:01:32,190 INFO L795 eck$LassoCheckResult]: Loop: 387#L34-4 assume true; 388#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 400#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 387#L34-4 [2018-11-10 02:01:32,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1545496489, now seen corresponding path program 2 times [2018-11-10 02:01:32,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:32,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/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-10 02:01:32,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:01:32,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:01:32,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:32,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 02:01:32,327 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:32,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 3 times [2018-11-10 02:01:32,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:01:32,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:01:32,361 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-10 02:01:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:32,393 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-10 02:01:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:01:32,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2018-11-10 02:01:32,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 44 transitions. [2018-11-10 02:01:32,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:32,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:32,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 44 transitions. [2018-11-10 02:01:32,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:32,396 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-10 02:01:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 44 transitions. [2018-11-10 02:01:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-10 02:01:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 02:01:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-10 02:01:32,399 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 02:01:32,399 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 02:01:32,399 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:01:32,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 38 transitions. [2018-11-10 02:01:32,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:32,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:32,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:32,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:32,404 INFO L793 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 556#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 550#L24-4 assume true; 551#L24-1 assume !!(main_~j~0 < 10); 570#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 564#L25-1 havoc main_#t~nondet4; 540#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 541#L26-1 havoc main_#t~nondet5; 557#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 558#L24-4 assume true; 571#L24-1 assume !!(main_~j~0 < 10); 576#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 575#L25-1 havoc main_#t~nondet4; 574#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 573#L26-1 havoc main_#t~nondet5; 572#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 552#L24-4 assume true; 553#L24-1 assume !!(main_~j~0 < 10); 563#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 565#L25-1 havoc main_#t~nondet4; 569#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 568#L26-1 havoc main_#t~nondet5; 567#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 566#L24-4 assume true; 562#L24-1 assume !(main_~j~0 < 10); 544#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 545#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 542#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 543#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 554#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 555#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 546#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 547#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 559#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 548#L34-4 [2018-11-10 02:01:32,405 INFO L795 eck$LassoCheckResult]: Loop: 548#L34-4 assume true; 549#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 560#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 548#L34-4 [2018-11-10 02:01:32,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash -255079917, now seen corresponding path program 3 times [2018-11-10 02:01:32,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:32,478 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:32,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:01:32,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 02:01:32,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:32,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:32,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 02:01:32,555 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:32,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 4 times [2018-11-10 02:01:32,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:01:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:01:32,588 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-10 02:01:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:32,618 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-10 02:01:32,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:01:32,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 52 transitions. [2018-11-10 02:01:32,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 51 transitions. [2018-11-10 02:01:32,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:32,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:32,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2018-11-10 02:01:32,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:32,621 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-10 02:01:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2018-11-10 02:01:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-11-10 02:01:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 02:01:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-10 02:01:32,624 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-10 02:01:32,624 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-10 02:01:32,624 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:01:32,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 45 transitions. [2018-11-10 02:01:32,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:32,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:32,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:32,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:32,629 INFO L793 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 747#L24-4 assume true; 748#L24-1 assume !!(main_~j~0 < 10); 780#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 779#L25-1 havoc main_#t~nondet4; 737#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 738#L26-1 havoc main_#t~nondet5; 778#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 749#L24-4 assume true; 750#L24-1 assume !!(main_~j~0 < 10); 760#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 761#L25-1 havoc main_#t~nondet4; 762#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 763#L26-1 havoc main_#t~nondet5; 754#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 755#L24-4 assume true; 777#L24-1 assume !!(main_~j~0 < 10); 776#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 775#L25-1 havoc main_#t~nondet4; 774#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 773#L26-1 havoc main_#t~nondet5; 772#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 771#L24-4 assume true; 765#L24-1 assume !!(main_~j~0 < 10); 770#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 769#L25-1 havoc main_#t~nondet4; 768#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 767#L26-1 havoc main_#t~nondet5; 766#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 764#L24-4 assume true; 759#L24-1 assume !(main_~j~0 < 10); 741#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 742#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 739#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 740#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 752#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 753#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 743#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 744#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 757#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 745#L34-4 [2018-11-10 02:01:32,629 INFO L795 eck$LassoCheckResult]: Loop: 745#L34-4 assume true; 746#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 758#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 745#L34-4 [2018-11-10 02:01:32,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1953141545, now seen corresponding path program 4 times [2018-11-10 02:01:32,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:32,704 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:32,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 02:01:32,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 02:01:32,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:32,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:32,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 02:01:32,789 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:32,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 5 times [2018-11-10 02:01:32,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:01:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:01:32,814 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 02:01:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:32,850 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-10 02:01:32,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:01:32,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 59 transitions. [2018-11-10 02:01:32,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 58 transitions. [2018-11-10 02:01:32,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:32,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:32,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 58 transitions. [2018-11-10 02:01:32,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:32,852 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 02:01:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 58 transitions. [2018-11-10 02:01:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-11-10 02:01:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 02:01:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-10 02:01:32,854 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-10 02:01:32,854 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-10 02:01:32,854 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:01:32,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2018-11-10 02:01:32,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:32,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:32,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:32,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:32,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:32,857 INFO L793 eck$LassoCheckResult]: Stem: 989#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 984#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 980#L24-4 assume true; 981#L24-1 assume !!(main_~j~0 < 10); 993#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 994#L25-1 havoc main_#t~nondet4; 995#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1018#L26-1 havoc main_#t~nondet5; 1017#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 982#L24-4 assume true; 983#L24-1 assume !!(main_~j~0 < 10); 1020#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1019#L25-1 havoc main_#t~nondet4; 970#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 971#L26-1 havoc main_#t~nondet5; 987#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 988#L24-4 assume true; 1016#L24-1 assume !!(main_~j~0 < 10); 1015#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1014#L25-1 havoc main_#t~nondet4; 1013#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1012#L26-1 havoc main_#t~nondet5; 1011#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1010#L24-4 assume true; 1009#L24-1 assume !!(main_~j~0 < 10); 1008#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1007#L25-1 havoc main_#t~nondet4; 1006#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1005#L26-1 havoc main_#t~nondet5; 1004#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1003#L24-4 assume true; 997#L24-1 assume !!(main_~j~0 < 10); 1002#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1001#L25-1 havoc main_#t~nondet4; 1000#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 999#L26-1 havoc main_#t~nondet5; 998#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 996#L24-4 assume true; 992#L24-1 assume !(main_~j~0 < 10); 974#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 975#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 972#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 973#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 985#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 986#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 976#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 977#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 990#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 978#L34-4 [2018-11-10 02:01:32,857 INFO L795 eck$LassoCheckResult]: Loop: 978#L34-4 assume true; 979#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 991#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 978#L34-4 [2018-11-10 02:01:32,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -210246253, now seen corresponding path program 5 times [2018-11-10 02:01:32,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:32,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:32,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:32,916 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:32,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 02:01:32,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 02:01:32,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:32,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:33,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 02:01:33,037 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:33,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 6 times [2018-11-10 02:01:33,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:01:33,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:01:33,059 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 02:01:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:33,105 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-11-10 02:01:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:01:33,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 66 transitions. [2018-11-10 02:01:33,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 65 transitions. [2018-11-10 02:01:33,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:33,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:33,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 65 transitions. [2018-11-10 02:01:33,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:33,107 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 02:01:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 65 transitions. [2018-11-10 02:01:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-11-10 02:01:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 02:01:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-10 02:01:33,112 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-10 02:01:33,112 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-10 02:01:33,112 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:01:33,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 59 transitions. [2018-11-10 02:01:33,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:33,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:33,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:33,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:33,115 INFO L793 eck$LassoCheckResult]: Stem: 1258#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1253#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 1249#L24-4 assume true; 1250#L24-1 assume !!(main_~j~0 < 10); 1296#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1295#L25-1 havoc main_#t~nondet4; 1239#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1240#L26-1 havoc main_#t~nondet5; 1294#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1251#L24-4 assume true; 1252#L24-1 assume !!(main_~j~0 < 10); 1262#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1263#L25-1 havoc main_#t~nondet4; 1264#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1265#L26-1 havoc main_#t~nondet5; 1256#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1257#L24-4 assume true; 1293#L24-1 assume !!(main_~j~0 < 10); 1292#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1291#L25-1 havoc main_#t~nondet4; 1290#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1289#L26-1 havoc main_#t~nondet5; 1288#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1287#L24-4 assume true; 1286#L24-1 assume !!(main_~j~0 < 10); 1285#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1284#L25-1 havoc main_#t~nondet4; 1283#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1282#L26-1 havoc main_#t~nondet5; 1281#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1280#L24-4 assume true; 1279#L24-1 assume !!(main_~j~0 < 10); 1278#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1277#L25-1 havoc main_#t~nondet4; 1276#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1275#L26-1 havoc main_#t~nondet5; 1274#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1273#L24-4 assume true; 1267#L24-1 assume !!(main_~j~0 < 10); 1272#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1271#L25-1 havoc main_#t~nondet4; 1270#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1269#L26-1 havoc main_#t~nondet5; 1268#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1266#L24-4 assume true; 1261#L24-1 assume !(main_~j~0 < 10); 1243#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 1244#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 1241#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 1242#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 1254#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 1255#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 1245#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 1246#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 1259#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 1247#L34-4 [2018-11-10 02:01:33,115 INFO L795 eck$LassoCheckResult]: Loop: 1247#L34-4 assume true; 1248#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 1260#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 1247#L34-4 [2018-11-10 02:01:33,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash 532373847, now seen corresponding path program 6 times [2018-11-10 02:01:33,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:33,187 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:33,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 02:01:33,293 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 02:01:33,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:33,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 02:01:33,331 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:33,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 7 times [2018-11-10 02:01:33,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:01:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:01:33,354 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-10 02:01:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:33,393 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-11-10 02:01:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:01:33,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 73 transitions. [2018-11-10 02:01:33,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 71 states and 72 transitions. [2018-11-10 02:01:33,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:33,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:33,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 72 transitions. [2018-11-10 02:01:33,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:33,396 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-10 02:01:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 72 transitions. [2018-11-10 02:01:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-11-10 02:01:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 02:01:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-10 02:01:33,399 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-10 02:01:33,400 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-10 02:01:33,400 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 02:01:33,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 66 transitions. [2018-11-10 02:01:33,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:33,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:33,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:33,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:33,401 INFO L793 eck$LassoCheckResult]: Stem: 1565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1559#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 1554#L24-4 assume true; 1555#L24-1 assume !!(main_~j~0 < 10); 1567#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1568#L25-1 havoc main_#t~nondet4; 1569#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1606#L26-1 havoc main_#t~nondet5; 1605#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1556#L24-4 assume true; 1557#L24-1 assume !!(main_~j~0 < 10); 1608#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1607#L25-1 havoc main_#t~nondet4; 1544#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1545#L26-1 havoc main_#t~nondet5; 1561#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1562#L24-4 assume true; 1604#L24-1 assume !!(main_~j~0 < 10); 1603#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1602#L25-1 havoc main_#t~nondet4; 1601#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1600#L26-1 havoc main_#t~nondet5; 1599#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1598#L24-4 assume true; 1597#L24-1 assume !!(main_~j~0 < 10); 1596#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1595#L25-1 havoc main_#t~nondet4; 1594#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1593#L26-1 havoc main_#t~nondet5; 1592#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1591#L24-4 assume true; 1590#L24-1 assume !!(main_~j~0 < 10); 1589#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1588#L25-1 havoc main_#t~nondet4; 1587#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1586#L26-1 havoc main_#t~nondet5; 1585#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1584#L24-4 assume true; 1583#L24-1 assume !!(main_~j~0 < 10); 1582#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1581#L25-1 havoc main_#t~nondet4; 1580#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1579#L26-1 havoc main_#t~nondet5; 1578#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1577#L24-4 assume true; 1571#L24-1 assume !!(main_~j~0 < 10); 1576#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1575#L25-1 havoc main_#t~nondet4; 1574#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1573#L26-1 havoc main_#t~nondet5; 1572#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1570#L24-4 assume true; 1566#L24-1 assume !(main_~j~0 < 10); 1548#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 1549#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 1546#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 1547#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 1560#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 1558#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 1550#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 1551#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 1563#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 1552#L34-4 [2018-11-10 02:01:33,401 INFO L795 eck$LassoCheckResult]: Loop: 1552#L34-4 assume true; 1553#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 1564#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 1552#L34-4 [2018-11-10 02:01:33,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash -351411949, now seen corresponding path program 7 times [2018-11-10 02:01:33,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:33,491 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:33,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 02:01:33,559 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:33,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 8 times [2018-11-10 02:01:33,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:01:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:01:33,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:01:33,584 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-10 02:01:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:33,625 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-10 02:01:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:01:33,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 80 transitions. [2018-11-10 02:01:33,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 78 states and 79 transitions. [2018-11-10 02:01:33,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:33,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:33,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 79 transitions. [2018-11-10 02:01:33,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:33,627 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-10 02:01:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 79 transitions. [2018-11-10 02:01:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2018-11-10 02:01:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 02:01:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-10 02:01:33,631 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-10 02:01:33,631 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-10 02:01:33,631 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 02:01:33,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2018-11-10 02:01:33,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:33,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:33,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:33,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:33,632 INFO L793 eck$LassoCheckResult]: Stem: 1904#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1899#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 1895#L24-4 assume true; 1896#L24-1 assume !!(main_~j~0 < 10); 1956#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1955#L25-1 havoc main_#t~nondet4; 1885#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1886#L26-1 havoc main_#t~nondet5; 1954#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1897#L24-4 assume true; 1898#L24-1 assume !!(main_~j~0 < 10); 1908#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1909#L25-1 havoc main_#t~nondet4; 1910#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1911#L26-1 havoc main_#t~nondet5; 1902#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1903#L24-4 assume true; 1953#L24-1 assume !!(main_~j~0 < 10); 1952#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1951#L25-1 havoc main_#t~nondet4; 1950#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1949#L26-1 havoc main_#t~nondet5; 1948#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1947#L24-4 assume true; 1946#L24-1 assume !!(main_~j~0 < 10); 1945#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1944#L25-1 havoc main_#t~nondet4; 1943#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1942#L26-1 havoc main_#t~nondet5; 1941#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1940#L24-4 assume true; 1939#L24-1 assume !!(main_~j~0 < 10); 1938#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1937#L25-1 havoc main_#t~nondet4; 1936#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1935#L26-1 havoc main_#t~nondet5; 1934#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1933#L24-4 assume true; 1932#L24-1 assume !!(main_~j~0 < 10); 1931#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1930#L25-1 havoc main_#t~nondet4; 1929#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1928#L26-1 havoc main_#t~nondet5; 1927#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1926#L24-4 assume true; 1925#L24-1 assume !!(main_~j~0 < 10); 1924#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1923#L25-1 havoc main_#t~nondet4; 1922#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1921#L26-1 havoc main_#t~nondet5; 1920#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1919#L24-4 assume true; 1913#L24-1 assume !!(main_~j~0 < 10); 1918#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 1917#L25-1 havoc main_#t~nondet4; 1916#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 1915#L26-1 havoc main_#t~nondet5; 1914#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 1912#L24-4 assume true; 1907#L24-1 assume !(main_~j~0 < 10); 1889#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 1890#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 1887#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 1888#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 1900#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 1901#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 1891#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 1892#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 1905#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 1893#L34-4 [2018-11-10 02:01:33,632 INFO L795 eck$LassoCheckResult]: Loop: 1893#L34-4 assume true; 1894#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 1906#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 1893#L34-4 [2018-11-10 02:01:33,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 505116119, now seen corresponding path program 8 times [2018-11-10 02:01:33,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:33,715 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:01:33,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:01:33,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:33,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:33,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:33,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 02:01:33,800 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:33,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 9 times [2018-11-10 02:01:33,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:33,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:01:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:01:33,823 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 02:01:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:33,878 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-11-10 02:01:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:01:33,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 87 transitions. [2018-11-10 02:01:33,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 85 states and 86 transitions. [2018-11-10 02:01:33,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:33,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:33,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 86 transitions. [2018-11-10 02:01:33,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:33,881 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-11-10 02:01:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 86 transitions. [2018-11-10 02:01:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-11-10 02:01:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 02:01:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-10 02:01:33,885 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-10 02:01:33,885 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-10 02:01:33,885 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 02:01:33,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 80 transitions. [2018-11-10 02:01:33,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:33,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:33,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:33,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:33,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:33,887 INFO L793 eck$LassoCheckResult]: Stem: 2281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 2272#L24-4 assume true; 2273#L24-1 assume !!(main_~j~0 < 10); 2285#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2286#L25-1 havoc main_#t~nondet4; 2287#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2338#L26-1 havoc main_#t~nondet5; 2337#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2274#L24-4 assume true; 2275#L24-1 assume !!(main_~j~0 < 10); 2340#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2339#L25-1 havoc main_#t~nondet4; 2262#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2263#L26-1 havoc main_#t~nondet5; 2279#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2280#L24-4 assume true; 2336#L24-1 assume !!(main_~j~0 < 10); 2335#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2334#L25-1 havoc main_#t~nondet4; 2333#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2332#L26-1 havoc main_#t~nondet5; 2331#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2330#L24-4 assume true; 2329#L24-1 assume !!(main_~j~0 < 10); 2328#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2327#L25-1 havoc main_#t~nondet4; 2326#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2325#L26-1 havoc main_#t~nondet5; 2324#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2323#L24-4 assume true; 2322#L24-1 assume !!(main_~j~0 < 10); 2321#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2320#L25-1 havoc main_#t~nondet4; 2319#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2318#L26-1 havoc main_#t~nondet5; 2317#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2316#L24-4 assume true; 2315#L24-1 assume !!(main_~j~0 < 10); 2314#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2313#L25-1 havoc main_#t~nondet4; 2312#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2311#L26-1 havoc main_#t~nondet5; 2310#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2309#L24-4 assume true; 2308#L24-1 assume !!(main_~j~0 < 10); 2307#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2306#L25-1 havoc main_#t~nondet4; 2305#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2304#L26-1 havoc main_#t~nondet5; 2303#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2302#L24-4 assume true; 2301#L24-1 assume !!(main_~j~0 < 10); 2300#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2299#L25-1 havoc main_#t~nondet4; 2298#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2297#L26-1 havoc main_#t~nondet5; 2296#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2295#L24-4 assume true; 2289#L24-1 assume !!(main_~j~0 < 10); 2294#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2293#L25-1 havoc main_#t~nondet4; 2292#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2291#L26-1 havoc main_#t~nondet5; 2290#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2288#L24-4 assume true; 2284#L24-1 assume !(main_~j~0 < 10); 2266#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 2267#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 2264#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 2265#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 2277#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 2278#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 2268#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 2269#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 2282#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 2270#L34-4 [2018-11-10 02:01:33,887 INFO L795 eck$LassoCheckResult]: Loop: 2270#L34-4 assume true; 2271#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 2283#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 2270#L34-4 [2018-11-10 02:01:33,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2000307053, now seen corresponding path program 9 times [2018-11-10 02:01:33,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:33,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:33,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:01:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:34,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:01:34,001 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c965f258-f70c-4148-8ed3-ca7921122f51/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:01:34,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:01:34,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 02:01:34,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:01:34,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:01:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:01:34,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:01:34,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 02:01:34,425 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:01:34,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 10 times [2018-11-10 02:01:34,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:34,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:34,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 02:01:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:01:34,463 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-10 02:01:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:01:34,523 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-10 02:01:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 02:01:34,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 89 transitions. [2018-11-10 02:01:34,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:34,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 88 transitions. [2018-11-10 02:01:34,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:01:34,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:01:34,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 88 transitions. [2018-11-10 02:01:34,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:01:34,526 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-10 02:01:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 88 transitions. [2018-11-10 02:01:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-10 02:01:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 02:01:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-10 02:01:34,529 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-10 02:01:34,529 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-10 02:01:34,529 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 02:01:34,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 87 transitions. [2018-11-10 02:01:34,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 02:01:34,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:01:34,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:01:34,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:01:34,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:01:34,531 INFO L793 eck$LassoCheckResult]: Stem: 2688#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet4, main_#t~nondet5, main_#t~post3, main_~j~0, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8, main_#t~mem9, main_#t~pre11, main_#t~mem10, main_#t~ret12, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 80;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~j~0 := 0; 2680#L24-4 assume true; 2681#L24-1 assume !!(main_~j~0 < 10); 2695#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2693#L25-1 havoc main_#t~nondet4; 2694#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2754#L26-1 havoc main_#t~nondet5; 2687#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2682#L24-4 assume true; 2683#L24-1 assume !!(main_~j~0 < 10); 2692#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2755#L25-1 havoc main_#t~nondet4; 2670#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2671#L26-1 havoc main_#t~nondet5; 2696#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2753#L24-4 assume true; 2752#L24-1 assume !!(main_~j~0 < 10); 2751#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2750#L25-1 havoc main_#t~nondet4; 2749#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2748#L26-1 havoc main_#t~nondet5; 2747#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2746#L24-4 assume true; 2745#L24-1 assume !!(main_~j~0 < 10); 2744#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2743#L25-1 havoc main_#t~nondet4; 2742#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2741#L26-1 havoc main_#t~nondet5; 2740#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2739#L24-4 assume true; 2738#L24-1 assume !!(main_~j~0 < 10); 2737#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2736#L25-1 havoc main_#t~nondet4; 2735#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2734#L26-1 havoc main_#t~nondet5; 2733#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2732#L24-4 assume true; 2731#L24-1 assume !!(main_~j~0 < 10); 2730#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2729#L25-1 havoc main_#t~nondet4; 2728#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2727#L26-1 havoc main_#t~nondet5; 2726#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2725#L24-4 assume true; 2724#L24-1 assume !!(main_~j~0 < 10); 2723#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2722#L25-1 havoc main_#t~nondet4; 2721#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2720#L26-1 havoc main_#t~nondet5; 2719#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2718#L24-4 assume true; 2717#L24-1 assume !!(main_~j~0 < 10); 2716#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2715#L25-1 havoc main_#t~nondet4; 2714#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2713#L26-1 havoc main_#t~nondet5; 2712#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2711#L24-4 assume true; 2710#L24-1 assume !!(main_~j~0 < 10); 2709#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2708#L25-1 havoc main_#t~nondet4; 2707#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2706#L26-1 havoc main_#t~nondet5; 2705#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2704#L24-4 assume true; 2698#L24-1 assume !!(main_~j~0 < 10); 2703#L25 SUMMARY for call write~int(main_#t~nondet4, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 0, 4); srcloc: L25 2702#L25-1 havoc main_#t~nondet4; 2701#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#array~0.base, main_~#array~0.offset + main_~j~0 * 8 + 4, 4); srcloc: L26 2700#L26-1 havoc main_#t~nondet5; 2699#L24-3 main_#t~post3 := main_~j~0;main_~j~0 := main_#t~post3 + 1;havoc main_#t~post3; 2697#L24-4 assume true; 2691#L24-1 assume !(main_~j~0 < 10); 2674#L24-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 2675#L30 SUMMARY for call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30 2672#L30-1 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L30-1 2673#L31 main_~pa~0.base, main_~pa~0.offset := main_#t~mem6.base, main_#t~mem6.offset + 0 + 4;havoc main_#t~mem6.base, main_#t~mem6.offset; 2685#L32 SUMMARY for call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L32 2686#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_#t~mem7.base, main_#t~mem7.offset + 0 + 4, 4); srcloc: L32-1 2676#L32-2 assume main_#t~mem8 > 0;havoc main_#t~mem8;havoc main_#t~mem7.base, main_#t~mem7.offset; 2677#L33 SUMMARY for call main_#t~mem9 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 8 + 4, 4); srcloc: L33 2689#L33-1 main_~i~0 := main_#t~mem9 - 10;havoc main_#t~mem9; 2678#L34-4 [2018-11-10 02:01:34,531 INFO L795 eck$LassoCheckResult]: Loop: 2678#L34-4 assume true; 2679#L34-1 SUMMARY for call main_#t~mem10 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L34-1 2690#L34-2 assume !!(main_~i~0 < main_#t~mem10);havoc main_#t~mem10;main_#t~pre11 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre11; 2678#L34-4 [2018-11-10 02:01:34,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2038584745, now seen corresponding path program 10 times [2018-11-10 02:01:34,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:34,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 11 times [2018-11-10 02:01:34,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:34,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:01:34,595 INFO L82 PathProgramCache]: Analyzing trace with hash -640536045, now seen corresponding path program 1 times [2018-11-10 02:01:34,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:01:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:01:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:01:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:01:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:01:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:02:33,598 WARN L179 SmtUtils]: Spent 58.91 s on a formula simplification. DAG size of input: 361 DAG size of output: 284 [2018-11-10 02:02:35,909 WARN L179 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 170 [2018-11-10 02:02:35,912 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:02:35,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:02:35,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:02:35,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:02:35,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:02:35,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:02:35,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:02:35,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:02:35,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: test25_false-unreach-call_true-termination.c_Iteration12_Lasso [2018-11-10 02:02:35,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:02:35,912 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:02:35,917 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-10 02:02:35,921 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-10 02:02:35,923 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-10 02:02:35,933 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-10 02:02:36,438 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2018-11-10 02:02:36,484 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-10 02:02:36,486 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-10 02:02:36,487 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-10 02:02:36,488 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-10 02:02:36,489 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-10 02:02:36,490 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-10 02:02:36,491 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-10 02:02:36,492 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-10 02:02:36,493 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-10 02:02:36,494 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-10 02:02:36,495 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-10 02:02:36,496 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-10 02:02:36,497 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-10 02:02:36,759 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:02:36,759 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:02:36,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:36,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:36,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:36,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:36,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:36,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:36,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:02:36,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:02:36,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:02:36,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:36,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:36,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:36,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:36,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:02:36,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:36,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:36,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,776 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:02:36,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,777 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:02:36,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:36,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:02:36,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 02:02:36,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:02:36,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:02:36,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:02:36,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:02:36,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:02:36,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:02:36,786 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:02:36,790 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:02:36,790 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:02:36,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:02:36,791 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:02:36,792 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:02:36,792 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1 Supporting invariants [] [2018-11-10 02:02:36,844 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 02:02:36,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:02:36,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:02:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:36,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:02:36,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:02:36,887 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-10 02:02:36,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:02:36,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 87 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 02:02:36,894 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 87 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 89 states and 91 transitions. Complement of second has 6 states. [2018-11-10 02:02:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:02:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:02:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 02:02:36,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 83 letters. Loop has 3 letters. [2018-11-10 02:02:36,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:36,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 86 letters. Loop has 3 letters. [2018-11-10 02:02:36,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:36,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 83 letters. Loop has 6 letters. [2018-11-10 02:02:36,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:02:36,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 91 transitions. [2018-11-10 02:02:36,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:02:36,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-11-10 02:02:36,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:02:36,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:02:36,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:02:36,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:02:36,898 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:02:36,898 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:02:36,898 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:02:36,898 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 02:02:36,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:02:36,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:02:36,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:02:36,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:02:36 BoogieIcfgContainer [2018-11-10 02:02:36,905 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:02:36,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:02:36,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:02:36,905 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:02:36,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:01:30" (3/4) ... [2018-11-10 02:02:36,909 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:02:36,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:02:36,910 INFO L168 Benchmark]: Toolchain (without parser) took 66798.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 960.3 MB in the beginning and 937.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:36,911 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:02:36,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:36,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:36,913 INFO L168 Benchmark]: Boogie Preprocessor took 22.81 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:36,913 INFO L168 Benchmark]: RCFGBuilder took 275.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:36,914 INFO L168 Benchmark]: BuchiAutomizer took 66246.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 937.6 MB in the end (delta: 176.5 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:02:36,915 INFO L168 Benchmark]: Witness Printer took 4.40 ms. Allocated memory is still 1.2 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:02:36,918 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 209.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.81 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 66246.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 937.6 MB in the end (delta: 176.5 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.40 ms. Allocated memory is still 1.2 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * j + 19 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#memory_int-unknown[pa][pa] and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 66.2s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 65.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 86 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 230 SDtfs, 326 SDslu, 686 SDs, 0 SdLazy, 321 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital235 mio100 ax100 hnf99 lsp95 ukn69 mio100 lsp42 div100 bol100 ite100 ukn100 eq171 hnf90 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...