./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/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 a2a51f996e4cf34954505c04e8fa9e53d244d46a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:11:24,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:11:24,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:11:24,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:11:24,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:11:24,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:11:24,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:11:24,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:11:24,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:11:24,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:11:24,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:11:24,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:11:24,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:11:24,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:11:24,599 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:11:24,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:11:24,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:11:24,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:11:24,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:11:24,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:11:24,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:11:24,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:11:24,607 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:11:24,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:11:24,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:11:24,608 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:11:24,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:11:24,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:11:24,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:11:24,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:11:24,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:11:24,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:11:24,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:11:24,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:11:24,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:11:24,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:11:24,613 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:11:24,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:11:24,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:11:24,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:11:24,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:11:24,625 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:11:24,625 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:11:24,625 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:11:24,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:11:24,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:11:24,627 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:11:24,627 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:11:24,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:11:24,628 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:11:24,628 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:11:24,628 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:11:24,629 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_6124ba51-8038-4a3b-8878-05e7373a1db7/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 -> a2a51f996e4cf34954505c04e8fa9e53d244d46a [2018-11-10 12:11:24,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:11:24,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:11:24,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:11:24,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:11:24,666 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:11:24,666 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i [2018-11-10 12:11:24,707 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/data/90b06e742/ce5f1ecc2ace4bb58fc6ac14630ae0de/FLAGfd5808038 [2018-11-10 12:11:25,164 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:11:25,165 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca_false-termination.c.i [2018-11-10 12:11:25,174 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/data/90b06e742/ce5f1ecc2ace4bb58fc6ac14630ae0de/FLAGfd5808038 [2018-11-10 12:11:25,186 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/data/90b06e742/ce5f1ecc2ace4bb58fc6ac14630ae0de [2018-11-10 12:11:25,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:11:25,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:11:25,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:11:25,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:11:25,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:11:25,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725d966c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25, skipping insertion in model container [2018-11-10 12:11:25,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:11:25,232 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:11:25,416 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:11:25,425 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:11:25,448 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:11:25,480 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:11:25,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25 WrapperNode [2018-11-10 12:11:25,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:11:25,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:11:25,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:11:25,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:11:25,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:11:25,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:11:25,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:11:25,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:11:25,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... [2018-11-10 12:11:25,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:11:25,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:11:25,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:11:25,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:11:25,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:11:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:11:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:11:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:11:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:11:25,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:11:25,766 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:11:25,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:11:25 BoogieIcfgContainer [2018-11-10 12:11:25,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:11:25,767 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:11:25,767 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:11:25,769 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:11:25,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:11:25,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:11:25" (1/3) ... [2018-11-10 12:11:25,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@543ce26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:11:25, skipping insertion in model container [2018-11-10 12:11:25,770 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:11:25,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:25" (2/3) ... [2018-11-10 12:11:25,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@543ce26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:11:25, skipping insertion in model container [2018-11-10 12:11:25,771 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:11:25,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:11:25" (3/3) ... [2018-11-10 12:11:25,772 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_traverse-alloca_false-termination.c.i [2018-11-10 12:11:25,807 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:11:25,808 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:11:25,808 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:11:25,809 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:11:25,810 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:11:25,810 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:11:25,810 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:11:25,810 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:11:25,810 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:11:25,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 12:11:25,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 12:11:25,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:25,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:25,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:11:25,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:11:25,838 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:11:25,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 12:11:25,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 12:11:25,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:25,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:25,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:11:25,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:11:25,847 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;assume { :begin_inline_init_cll } true;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; 19#L550true SUMMARY for call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset + 0, 4); srcloc: L550 21#L550-1true init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 3#L552-4true [2018-11-10 12:11:25,848 INFO L795 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 15#L552-1true assume !!(init_cll_~i~0 < init_cll_~n);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset; 8#L554true SUMMARY for call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset + 0, 4); srcloc: L554 11#L554-1true SUMMARY for call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset + 4, 8); srcloc: L554-1 6#L555true init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 22#L552-3true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := init_cll_#t~post3 + 1;havoc init_cll_#t~post3; 3#L552-4true [2018-11-10 12:11:25,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 12:11:25,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:25,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:25,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:25,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1128974665, now seen corresponding path program 1 times [2018-11-10 12:11:25,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:25,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:25,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:25,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:25,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:25,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -686910868, now seen corresponding path program 1 times [2018-11-10 12:11:25,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:25,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:25,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:26,190 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-10 12:11:26,398 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:11:26,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:11:26,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:11:26,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:11:26,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:11:26,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:11:26,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:11:26,400 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:11:26,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-10 12:11:26,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:11:26,401 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:11:26,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:26,679 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-10 12:11:26,941 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:11:26,945 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:11:26,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:26,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:26,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:26,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:26,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:26,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:26,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:26,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:26,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:26,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:26,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:26,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:26,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:26,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:26,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:26,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:26,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:26,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:26,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:27,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:27,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:27,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:27,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:27,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:27,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:27,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:27,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:27,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:27,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:27,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:27,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:27,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:27,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:27,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:27,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:27,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:27,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:27,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:27,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:27,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:27,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:27,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:27,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:27,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:27,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:27,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:27,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:27,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:27,018 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:11:27,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:11:27,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:27,026 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 12:11:27,026 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:11:27,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:27,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:11:27,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:27,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:27,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:27,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:27,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:27,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:27,100 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:11:27,127 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-10 12:11:27,128 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 12:11:27,130 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:11:27,132 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 12:11:27,132 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:11:27,133 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~n, v_rep(select (select #memory_int ULTIMATE.start_init_cll_~curr~0.base) ULTIMATE.start_init_cll_~curr~0.offset)_1) = 1*ULTIMATE.start_init_cll_~n - 1*v_rep(select (select #memory_int ULTIMATE.start_init_cll_~curr~0.base) ULTIMATE.start_init_cll_~curr~0.offset)_1 Supporting invariants [1*ULTIMATE.start_init_cll_~i~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_init_cll_~curr~0.base) ULTIMATE.start_init_cll_~curr~0.offset)_1 - 1 >= 0] [2018-11-10 12:11:27,171 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 12:11:27,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:11:27,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:27,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:11:27,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:11:27,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:11:27,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:11:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:27,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:11:27,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 12:11:27,346 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:11:27,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 12:11:27,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:11:27,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-10 12:11:27,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:11:27,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 12:11:27,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:48 [2018-11-10 12:11:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:11:27,453 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 12:11:27,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2018-11-10 12:11:27,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 65 states and 74 transitions. Complement of second has 12 states. [2018-11-10 12:11:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-10 12:11:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:11:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-10 12:11:27,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 12:11:27,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:27,567 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:11:27,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:27,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:11:27,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:11:27,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:11:27,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:11:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:27,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:11:27,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 12:11:27,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:11:27,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 12:11:27,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:11:27,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-10 12:11:27,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:11:27,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:11:27,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 12:11:27,750 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:48 [2018-11-10 12:11:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:11:27,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 12:11:27,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2018-11-10 12:11:27,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 49 states and 56 transitions. Complement of second has 12 states. [2018-11-10 12:11:27,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 12:11:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:11:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2018-11-10 12:11:27,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 12:11:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:27,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 12:11:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:27,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 12:11:27,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:27,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-11-10 12:11:27,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 12:11:27,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 19 states and 21 transitions. [2018-11-10 12:11:27,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 12:11:27,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 12:11:27,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-10 12:11:27,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:11:27,865 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-10 12:11:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-10 12:11:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 12:11:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 12:11:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-10 12:11:27,882 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-10 12:11:27,882 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-10 12:11:27,882 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:11:27,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-11-10 12:11:27,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 12:11:27,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:27,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:27,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:27,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 12:11:27,883 INFO L793 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;assume { :begin_inline_init_cll } true;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; 298#L550 SUMMARY for call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset + 0, 4); srcloc: L550 302#L550-1 init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 284#L552-4 assume true; 286#L552-1 assume !(init_cll_~i~0 < init_cll_~n); 290#L552-5 SUMMARY for call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset + 4, 8); srcloc: L552-5 288#L558 init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 289#L559 main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;assume { :end_inline_init_cll } true;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;assume { :begin_inline_traverse } true;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 299#L564-3 [2018-11-10 12:11:27,883 INFO L795 eck$LassoCheckResult]: Loop: 299#L564-3 assume true; 300#L564-1 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); 293#L565 SUMMARY for call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, traverse_~curr~1.offset + 4, 8); srcloc: L565 294#L565-1 traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; 299#L564-3 [2018-11-10 12:11:27,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1778905265, now seen corresponding path program 1 times [2018-11-10 12:11:27,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:27,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:27,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1822248, now seen corresponding path program 1 times [2018-11-10 12:11:27,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:27,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:27,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:27,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1314645720, now seen corresponding path program 1 times [2018-11-10 12:11:27,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:28,094 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2018-11-10 12:11:28,159 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:11:28,161 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:11:28,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:11:28 BoogieIcfgContainer [2018-11-10 12:11:28,171 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:11:28,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:11:28,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:11:28,171 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:11:28,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:11:25" (3/4) ... [2018-11-10 12:11:28,174 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 12:11:28,198 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6124ba51-8038-4a3b-8878-05e7373a1db7/bin-2019/uautomizer/witness.graphml [2018-11-10 12:11:28,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:11:28,199 INFO L168 Benchmark]: Toolchain (without parser) took 3010.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 956.6 MB in the beginning and 897.4 MB in the end (delta: 59.2 MB). Peak memory consumption was 197.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:28,200 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:11:28,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.41 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:28,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:28,201 INFO L168 Benchmark]: Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:11:28,201 INFO L168 Benchmark]: RCFGBuilder took 199.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:28,201 INFO L168 Benchmark]: BuchiAutomizer took 2403.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.6 MB in the end (delta: 208.7 MB). Peak memory consumption was 208.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:28,202 INFO L168 Benchmark]: Witness Printer took 27.53 ms. Allocated memory is still 1.2 GB. Free memory was 902.6 MB in the beginning and 897.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:28,204 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.41 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 199.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2403.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.6 MB in the end (delta: 208.7 MB). Peak memory consumption was 208.7 MB. Max. memory is 11.5 GB. * Witness Printer took 27.53 ms. Allocated memory is still 1.2 GB. Free memory was 902.6 MB in the beginning and 897.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * unknown-#memory_int-unknown[curr][curr] and consists of 8 locations. The remainder module has 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 50 SDslu, 69 SDs, 0 SdLazy, 48 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf100 lsp96 ukn83 mio100 lsp19 div100 bol100 ite100 ukn100 eq216 hnf89 smp100 dnf176 smp100 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 564]: Nontermination argument in form of an infinite program execution. [2018-11-10 12:11:28,211 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:11:28,213 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:11:28,213 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:11:28,215 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@747d952d=0, \result=0, next_node=0, \result=3, next_node=0, head=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62359a17=0, NULL=12, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@747d952d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cad23f4=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@55b0c533=0, head=0, head=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66df283=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66df283=0, curr=0, \old(n)=0, n=0, head=3, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14653d5=0, head=0, head=3, curr=3, NULL=0, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14653d5=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cad23f4=0, curr=3, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L571] CALL, EXPR init_cll(n) [L548] node_t* head; [L549] EXPR, FCALL malloc(sizeof(node_t)) [L549] node_t* curr = malloc(sizeof(node_t)); [L550] FCALL curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] FCALL curr->next = head [L559] RET return head; [L571] EXPR init_cll(n) [L571] node_t* head = init_cll(n); [L572] CALL traverse(head) [L563] node_t* curr = head; Loop: [L564] COND TRUE curr != ((void *)0) [L565] EXPR, FCALL curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...