./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:53:45,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:53:45,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:53:45,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:53:45,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:53:45,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:53:45,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:53:45,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:53:45,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:53:45,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:53:45,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:53:45,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:53:45,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:53:45,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:53:45,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:53:45,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:53:45,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:53:45,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:53:45,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:53:45,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:53:45,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:53:45,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:53:45,589 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:53:45,589 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:53:45,589 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:53:45,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:53:45,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:53:45,590 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:53:45,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:53:45,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:53:45,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:53:45,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:53:45,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:53:45,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:53:45,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:53:45,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:53:45,593 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 14:53:45,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:53:45,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:53:45,601 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:53:45,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:53:45,601 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:53:45,601 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 14:53:45,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 14:53:45,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 14:53:45,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 14:53:45,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:53:45,603 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 14:53:45,604 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 14:53:45,604 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_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2018-12-02 14:53:45,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:53:45,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:53:45,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:53:45,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:53:45,630 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:53:45,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-12-02 14:53:45,666 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/data/b4ecfcb89/deb0f34b9f294cbfb37446f98ef41fba/FLAG660bc0b7d [2018-12-02 14:53:46,110 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:53:46,111 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-12-02 14:53:46,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/data/b4ecfcb89/deb0f34b9f294cbfb37446f98ef41fba/FLAG660bc0b7d [2018-12-02 14:53:46,129 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/bin-2019/uautomizer/data/b4ecfcb89/deb0f34b9f294cbfb37446f98ef41fba [2018-12-02 14:53:46,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:53:46,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:53:46,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:53:46,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:53:46,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:53:46,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0ff27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46, skipping insertion in model container [2018-12-02 14:53:46,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:53:46,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:53:46,309 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:53:46,315 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:53:46,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:53:46,407 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:53:46,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46 WrapperNode [2018-12-02 14:53:46,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:53:46,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:53:46,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:53:46,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:53:46,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:53:46,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:53:46,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:53:46,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:53:46,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... [2018-12-02 14:53:46,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:53:46,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:53:46,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:53:46,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:53:46,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/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-12-02 14:53:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:53:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:53:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:53:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:53:46,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:53:46,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:53:46,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:53:46,578 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 14:53:46,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:46 BoogieIcfgContainer [2018-12-02 14:53:46,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:53:46,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 14:53:46,578 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 14:53:46,580 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 14:53:46,581 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:53:46,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:53:46" (1/3) ... [2018-12-02 14:53:46,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d817fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:53:46, skipping insertion in model container [2018-12-02 14:53:46,582 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:53:46,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:53:46" (2/3) ... [2018-12-02 14:53:46,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d817fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:53:46, skipping insertion in model container [2018-12-02 14:53:46,582 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:53:46,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:46" (3/3) ... [2018-12-02 14:53:46,583 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca_true-termination.c.i [2018-12-02 14:53:46,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:53:46,614 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 14:53:46,614 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 14:53:46,614 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 14:53:46,614 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:53:46,614 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:53:46,614 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 14:53:46,614 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:53:46,614 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 14:53:46,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-02 14:53:46,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 14:53:46,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:53:46,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:53:46,638 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 14:53:46,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:53:46,638 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 14:53:46,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-02 14:53:46,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 14:53:46,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:53:46,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:53:46,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 14:53:46,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:53:46,644 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 17#L367true assume !(main_~length~0 < 1); 3#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2018-12-02 14:53:46,644 INFO L796 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2018-12-02 14:53:46,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-02 14:53:46,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:46,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:46,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:46,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:46,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:46,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-12-02 14:53:46,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:46,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:46,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:46,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:46,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:46,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-12-02 14:53:46,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:46,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:46,877 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:53:46,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:53:46,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:53:46,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:53:46,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:53:46,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:53:46,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:53:46,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:53:46,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 14:53:46,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:53:46,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:53:46,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:46,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:46,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:53:47,146 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:53:47,147 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-12-02 14:53:47,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:47,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:47,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:47,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:47,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:47,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:47,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:47,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:47,151 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-12-02 14:53:47,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:47,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:47,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:47,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:47,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:53:47,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:53:47,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:47,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:53:47,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:47,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:47,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:47,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:47,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:53:47,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:53:47,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:53:47,239 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:53:47,239 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 14:53:47,241 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:53:47,242 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:53:47,243 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:53:47,243 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-12-02 14:53:47,252 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 14:53:47,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 14:53:47,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:47,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:47,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:47,314 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-12-02 14:53:47,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2018-12-02 14:53:47,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 54 transitions. Complement of second has 7 states. [2018-12-02 14:53:47,346 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-12-02 14:53:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:53:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-12-02 14:53:47,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 14:53:47,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:47,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 14:53:47,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:47,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 14:53:47,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:47,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2018-12-02 14:53:47,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 14:53:47,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2018-12-02 14:53:47,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 14:53:47,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 14:53:47,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 14:53:47,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:53:47,356 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 14:53:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 14:53:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 14:53:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 14:53:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 14:53:47,372 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 14:53:47,372 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 14:53:47,372 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 14:53:47,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 14:53:47,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 14:53:47,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:53:47,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:53:47,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:53:47,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 14:53:47,373 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 119#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 120#L367 assume !(main_~length~0 < 1); 126#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 127#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 128#L371-3 assume !(main_~i~0 < main_~length~0); 131#L371-4 main_~j~0 := 0; 124#L374-3 [2018-12-02 14:53:47,373 INFO L796 eck$LassoCheckResult]: Loop: 124#L374-3 assume !!(main_~j~0 < main_~length~0); 121#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 122#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 123#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 124#L374-3 [2018-12-02 14:53:47,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-12-02 14:53:47,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:47,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2018-12-02 14:53:47,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:47,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2018-12-02 14:53:47,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,519 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:53:47,520 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:53:47,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:53:47,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:53:47,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:53:47,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:53:47,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:53:47,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:53:47,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 14:53:47,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:53:47,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:53:47,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:47,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:53:47,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:53:47,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:53:47,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:47,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:47,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:47,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:47,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:47,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:47,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:47,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:47,729 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-12-02 14:53:47,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:47,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:47,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:47,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:47,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:47,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:47,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:47,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:47,730 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-12-02 14:53:47,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:47,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:47,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:47,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:47,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:53:47,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:53:47,743 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:53:47,751 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 14:53:47,752 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 14:53:47,752 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:53:47,752 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 14:53:47,753 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:53:47,753 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2018-12-02 14:53:47,756 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 14:53:47,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 14:53:47,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:47,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:47,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:47,789 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-12-02 14:53:47,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-02 14:53:47,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 19 states and 25 transitions. Complement of second has 6 states. [2018-12-02 14:53:47,803 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-12-02 14:53:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 14:53:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 14:53:47,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 14:53:47,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:47,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 14:53:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:47,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-02 14:53:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:47,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-12-02 14:53:47,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 14:53:47,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2018-12-02 14:53:47,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 14:53:47,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 14:53:47,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-12-02 14:53:47,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:53:47,807 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 14:53:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-12-02 14:53:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-02 14:53:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 14:53:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-12-02 14:53:47,808 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-02 14:53:47,808 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-02 14:53:47,808 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 14:53:47,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-12-02 14:53:47,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 14:53:47,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:53:47,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:53:47,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:53:47,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:53:47,810 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 226#L367 assume !(main_~length~0 < 1); 229#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 230#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 231#L371-3 assume !(main_~i~0 < main_~length~0); 234#L371-4 main_~j~0 := 0; 227#L374-3 assume !!(main_~j~0 < main_~length~0); 219#L375-3 [2018-12-02 14:53:47,810 INFO L796 eck$LassoCheckResult]: Loop: 219#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 220#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 219#L375-3 [2018-12-02 14:53:47,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2018-12-02 14:53:47,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:47,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2018-12-02 14:53:47,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:47,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:47,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2018-12-02 14:53:47,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:47,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:53:47,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:53:47,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:53:47,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:53:47,961 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 14:53:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:53:48,012 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-02 14:53:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:53:48,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-02 14:53:48,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 14:53:48,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2018-12-02 14:53:48,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 14:53:48,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 14:53:48,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-12-02 14:53:48,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:53:48,015 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-02 14:53:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-12-02 14:53:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-02 14:53:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 14:53:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-12-02 14:53:48,016 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-02 14:53:48,016 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-02 14:53:48,016 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 14:53:48,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-12-02 14:53:48,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 14:53:48,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:53:48,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:53:48,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:53:48,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:53:48,018 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 282#L367 assume !(main_~length~0 < 1); 286#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 287#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 288#L371-3 assume !(main_~i~0 < main_~length~0); 292#L371-4 main_~j~0 := 0; 283#L374-3 assume !!(main_~j~0 < main_~length~0); 284#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 291#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 279#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 280#L374-3 assume !!(main_~j~0 < main_~length~0); 275#L375-3 [2018-12-02 14:53:48,018 INFO L796 eck$LassoCheckResult]: Loop: 275#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 276#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 275#L375-3 [2018-12-02 14:53:48,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2018-12-02 14:53:48,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:48,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:48,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:53:48,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0936ef4f-24c2-4644-a9f3-41c62b56f464/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-12-02 14:53:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:53:48,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:53:48,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:53:48,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:53:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-12-02 14:53:48,119 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:53:48,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2018-12-02 14:53:48,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:53:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:53:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:53:48,147 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-12-02 14:53:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:53:48,205 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-02 14:53:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:53:48,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-12-02 14:53:48,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 14:53:48,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 22 transitions. [2018-12-02 14:53:48,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 14:53:48,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 14:53:48,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-12-02 14:53:48,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 14:53:48,206 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-02 14:53:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-12-02 14:53:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-02 14:53:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 14:53:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-02 14:53:48,208 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 14:53:48,208 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 14:53:48,208 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 14:53:48,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-02 14:53:48,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 14:53:48,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:53:48,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:53:48,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:53:48,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 14:53:48,209 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 381#L367 assume !(main_~length~0 < 1); 385#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 386#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 389#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 387#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 388#L371-3 assume !(main_~i~0 < main_~length~0); 391#L371-4 main_~j~0 := 0; 382#L374-3 assume !!(main_~j~0 < main_~length~0); 383#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 390#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 378#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 379#L374-3 assume !!(main_~j~0 < main_~length~0); 374#L375-3 [2018-12-02 14:53:48,209 INFO L796 eck$LassoCheckResult]: Loop: 374#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 375#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 374#L375-3 [2018-12-02 14:53:48,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2018-12-02 14:53:48,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:48,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:53:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2018-12-02 14:53:48,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:53:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2018-12-02 14:53:48,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:53:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:53:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:53:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:53:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:53:48,385 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2018-12-02 14:53:48,413 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:53:48,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:53:48,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:53:48,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:53:48,414 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:53:48,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:53:48,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:53:48,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:53:48,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 14:53:48,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:53:48,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:53:48,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:53:48,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:53:48,573 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:53:48,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:53:48,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,575 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-12-02 14:53:48,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,576 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-12-02 14:53:48,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:53:48,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:53:48,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,578 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-12-02 14:53:48,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,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-12-02 14:53:48,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,580 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-12-02 14:53:48,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,581 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-12-02 14:53:48,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,583 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-12-02 14:53:48,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:53:48,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 14:53:48,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:53:48,585 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-12-02 14:53:48,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:53:48,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:53:48,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:53:48,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:53:48,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:53:48,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:53:48,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:53:48,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 14:53:48,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 14:53:48,587 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 14:53:48,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 14:53:48,587 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 14:53:48,588 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 14:53:48,588 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-12-02 14:53:48,596 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 14:53:48,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 14:53:48,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:48,624 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-12-02 14:53:48,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 14:53:48,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-12-02 14:53:48,632 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-12-02 14:53:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:53:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-02 14:53:48,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 14:53:48,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:48,633 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:53:48,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:48,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 14:53:48,656 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 14:53:48,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-12-02 14:53:48,662 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-12-02 14:53:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:53:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-02 14:53:48,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 14:53:48,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:48,662 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 14:53:48,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:53:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:53:48,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:53:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:48,688 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 14:53:48,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 14:53:48,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2018-12-02 14:53:48,696 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-12-02 14:53:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 14:53:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 14:53:48,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 14:53:48,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:48,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-02 14:53:48,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:48,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-02 14:53:48,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 14:53:48,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-12-02 14:53:48,698 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 14:53:48,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-12-02 14:53:48,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 14:53:48,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 14:53:48,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 14:53:48,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:53:48,699 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:53:48,699 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:53:48,699 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:53:48,699 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 14:53:48,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:53:48,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 14:53:48,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 14:53:48,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:53:48 BoogieIcfgContainer [2018-12-02 14:53:48,703 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 14:53:48,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:53:48,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:53:48,704 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:53:48,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:53:46" (3/4) ... [2018-12-02 14:53:48,706 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 14:53:48,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:53:48,707 INFO L168 Benchmark]: Toolchain (without parser) took 2576.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 950.6 MB in the beginning and 854.6 MB in the end (delta: 96.0 MB). Peak memory consumption was 211.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:48,708 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:53:48,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:48,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:48,709 INFO L168 Benchmark]: Boogie Preprocessor took 14.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:53:48,709 INFO L168 Benchmark]: RCFGBuilder took 132.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:48,709 INFO L168 Benchmark]: BuchiAutomizer took 2125.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 854.6 MB in the end (delta: 225.6 MB). Peak memory consumption was 225.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:48,710 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.1 GB. Free memory is still 854.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:53:48,712 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 132.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2125.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 854.6 MB in the end (delta: 225.6 MB). Peak memory consumption was 225.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.1 GB. Free memory is still 854.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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 123 SDslu, 53 SDs, 0 SdLazy, 132 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf99 lsp95 ukn75 mio100 lsp61 div100 bol100 ite100 ukn100 eq154 hnf91 smp92 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...