./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/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 18edad3aefc49839189b8c997aba3dd32264f7ca .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-aa41828 [2018-11-23 08:36:49,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:36:49,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:36:49,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:36:49,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:36:49,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:36:49,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:36:49,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:36:49,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:36:49,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:36:49,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:36:49,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:36:49,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:36:49,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:36:49,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:36:49,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:36:49,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:36:49,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:36:49,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:36:49,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:36:49,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:36:49,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:36:49,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:36:49,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:36:49,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:36:49,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:36:49,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:36:49,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:36:49,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:36:49,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:36:49,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:36:49,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:36:49,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:36:49,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:36:49,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:36:49,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:36:49,611 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 08:36:49,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:36:49,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:36:49,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:36:49,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:36:49,623 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:36:49,623 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 08:36:49,624 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 08:36:49,624 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 08:36:49,624 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 08:36:49,624 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 08:36:49,624 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 08:36:49,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:36:49,624 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:36:49,625 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 08:36:49,626 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:36:49,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 08:36:49,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:36:49,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:36:49,626 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 08:36:49,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:36:49,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:36:49,627 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 08:36:49,627 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 08:36:49,627 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_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/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 -> 18edad3aefc49839189b8c997aba3dd32264f7ca [2018-11-23 08:36:49,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:36:49,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:36:49,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:36:49,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:36:49,666 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:36:49,666 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2018-11-23 08:36:49,699 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/data/0e0c84c1a/152a505aa1b846ee9cb4b642dd2cc2ef/FLAG8b7f546b3 [2018-11-23 08:36:50,138 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:36:50,139 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2018-11-23 08:36:50,148 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/data/0e0c84c1a/152a505aa1b846ee9cb4b642dd2cc2ef/FLAG8b7f546b3 [2018-11-23 08:36:50,156 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/data/0e0c84c1a/152a505aa1b846ee9cb4b642dd2cc2ef [2018-11-23 08:36:50,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:36:50,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:36:50,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:50,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:36:50,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:36:50,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bab14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50, skipping insertion in model container [2018-11-23 08:36:50,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:36:50,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:36:50,384 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:50,393 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:36:50,461 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:36:50,490 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:36:50,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50 WrapperNode [2018-11-23 08:36:50,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:36:50,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:50,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:36:50,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:36:50,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:36:50,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:36:50,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:36:50,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:36:50,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... [2018-11-23 08:36:50,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:36:50,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:36:50,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:36:50,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:36:50,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/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-23 08:36:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2018-11-23 08:36:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2018-11-23 08:36:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:36:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:36:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 08:36:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 08:36:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure length [2018-11-23 08:36:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2018-11-23 08:36:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:36:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:36:50,809 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:36:50,809 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 08:36:50,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:50 BoogieIcfgContainer [2018-11-23 08:36:50,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:36:50,810 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 08:36:50,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 08:36:50,813 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 08:36:50,813 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:36:50,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 08:36:50" (1/3) ... [2018-11-23 08:36:50,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7be9f32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:36:50, skipping insertion in model container [2018-11-23 08:36:50,814 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:36:50,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:50" (2/3) ... [2018-11-23 08:36:50,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7be9f32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:36:50, skipping insertion in model container [2018-11-23 08:36:50,814 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:36:50,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:50" (3/3) ... [2018-11-23 08:36:50,815 INFO L375 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca_false-termination.c.i [2018-11-23 08:36:50,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:36:50,852 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 08:36:50,852 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 08:36:50,852 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 08:36:50,852 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:36:50,852 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:36:50,852 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 08:36:50,852 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:36:50,852 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 08:36:50,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-23 08:36:50,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 08:36:50,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:50,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:50,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 08:36:50,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 08:36:50,888 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 08:36:50,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-23 08:36:50,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 08:36:50,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:50,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:50,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 08:36:50,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 08:36:50,895 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 12#L574true assume !(main_~n~0 < 1); 7#L577true call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 15#new_llENTRYtrue [2018-11-23 08:36:50,895 INFO L796 eck$LassoCheckResult]: Loop: 15#new_llENTRYtrue ~n := #in~n; 29#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 22#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 15#new_llENTRYtrue [2018-11-23 08:36:50,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2018-11-23 08:36:50,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:50,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:50,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:50,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2018-11-23 08:36:50,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:50,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:50,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:50,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:50,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:51,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2018-11-23 08:36:51,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:51,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:51,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:51,186 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-11-23 08:36:51,460 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:36:51,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:36:51,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:36:51,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:36:51,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:36:51,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:36:51,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:36:51,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:36:51,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 08:36:51,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:36:51,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:36:51,479 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-23 08:36:51,483 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-23 08:36:51,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,498 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-23 08:36:51,500 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-23 08:36:51,502 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-23 08:36:51,503 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-23 08:36:51,504 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-23 08:36:51,505 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-23 08:36:51,507 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-23 08:36:51,509 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-23 08:36:51,511 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-23 08:36:51,513 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-23 08:36:51,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,520 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-23 08:36:51,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,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-11-23 08:36:51,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-11-23 08:36:51,526 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-23 08:36:51,528 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-23 08:36:51,530 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-23 08:36:51,531 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-23 08:36:51,533 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-23 08:36:51,563 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-23 08:36:51,564 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-23 08:36:51,566 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-23 08:36:51,569 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-23 08:36:51,572 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-23 08:36:51,574 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-23 08:36:51,575 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-23 08:36:51,577 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-23 08:36:51,578 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-23 08:36:51,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:36:51,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:36:51,768 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:36:51,769 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-23 08:36:51,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:36:51,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,777 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-23 08:36:51,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:36:51,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,781 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-23 08:36:51,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,783 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-23 08:36:51,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,785 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-23 08:36:51,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,787 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-23 08:36:51,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,789 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-23 08:36:51,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,792 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-23 08:36:51,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,794 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-23 08:36:51,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,797 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-23 08:36:51,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,800 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-23 08:36:51,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,802 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-23 08:36:51,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,804 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-23 08:36:51,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,807 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-23 08:36:51,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:36:51,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:36:51,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,811 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-23 08:36:51,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,814 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-23 08:36:51,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,820 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-23 08:36:51,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,823 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-23 08:36:51,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,828 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-23 08:36:51,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,831 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-23 08:36:51,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,834 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-23 08:36:51,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,836 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-23 08:36:51,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,838 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-23 08:36:51,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,841 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-23 08:36:51,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,843 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-23 08:36:51,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,845 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-23 08:36:51,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:36:51,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:36:51,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,851 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-23 08:36:51,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,852 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-23 08:36:51,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,854 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-23 08:36:51,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:36:51,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:36:51,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:36:51,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:36:51,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:36:51,856 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-23 08:36:51,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:36:51,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:36:51,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:36:51,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:36:51,859 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 08:36:51,860 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 08:36:51,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:36:51,931 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 08:36:51,931 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 08:36:51,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:36:51,937 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 08:36:51,937 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:36:51,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2018-11-23 08:36:51,962 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 08:36:51,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:52,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:52,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:52,071 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-23 08:36:52,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 08:36:52,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2018-11-23 08:36:52,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 5 states. Result 45 states and 54 transitions. Complement of second has 13 states. [2018-11-23 08:36:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 08:36:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 08:36:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-23 08:36:52,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 08:36:52,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:36:52,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 08:36:52,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:36:52,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 08:36:52,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:36:52,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2018-11-23 08:36:52,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:52,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2018-11-23 08:36:52,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 08:36:52,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 08:36:52,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2018-11-23 08:36:52,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:36:52,220 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 08:36:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2018-11-23 08:36:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 08:36:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 08:36:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 08:36:52,241 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 08:36:52,241 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 08:36:52,241 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 08:36:52,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-23 08:36:52,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:52,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:52,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:52,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:52,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:36:52,243 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 159#L574 assume !(main_~n~0 < 1); 141#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 151#new_llENTRY ~n := #in~n; 163#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 140#new_llFINAL assume true; 142#new_llEXIT >#57#return; 153#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 154#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 157#L566-3 [2018-11-23 08:36:52,243 INFO L796 eck$LassoCheckResult]: Loop: 157#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 155#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 157#L566-3 [2018-11-23 08:36:52,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2018-11-23 08:36:52,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:52,289 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-23 08:36:52,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:52,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:36:52,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:36:52,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2018-11-23 08:36:52,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:52,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:52,349 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 08:36:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:52,371 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 08:36:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:52,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-11-23 08:36:52,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:52,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 08:36:52,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 08:36:52,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 08:36:52,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2018-11-23 08:36:52,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:36:52,376 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 08:36:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2018-11-23 08:36:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 08:36:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 08:36:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 08:36:52,379 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 08:36:52,379 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 08:36:52,379 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 08:36:52,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2018-11-23 08:36:52,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:52,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:52,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:52,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:52,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 08:36:52,381 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 224#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 225#L574 assume !(main_~n~0 < 1); 215#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 217#new_llENTRY ~n := #in~n; 229#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 231#new_llFINAL assume true; 227#new_llEXIT >#57#return; 219#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 220#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 213#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 210#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 209#lengthENTRY [2018-11-23 08:36:52,381 INFO L796 eck$LassoCheckResult]: Loop: 209#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 212#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 211#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 209#lengthENTRY [2018-11-23 08:36:52,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -250149368, now seen corresponding path program 1 times [2018-11-23 08:36:52,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:52,405 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-23 08:36:52,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:52,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:36:52,406 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:36:52,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2018-11-23 08:36:52,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:36:52,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:36:52,486 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 08:36:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:52,515 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 08:36:52,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:36:52,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-23 08:36:52,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:52,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2018-11-23 08:36:52,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 08:36:52,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-23 08:36:52,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-23 08:36:52,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:36:52,518 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 08:36:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-23 08:36:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 08:36:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 08:36:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 08:36:52,521 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 08:36:52,521 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 08:36:52,521 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 08:36:52,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-23 08:36:52,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:52,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:52,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:52,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:52,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:36:52,523 INFO L794 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 290#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 291#L574 assume !(main_~n~0 < 1); 281#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 283#new_llENTRY ~n := #in~n; 293#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 273#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 284#new_llENTRY ~n := #in~n; 294#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 272#new_llFINAL assume true; 274#new_llEXIT >#53#return; 280#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 282#new_llFINAL assume true; 295#new_llEXIT >#57#return; 285#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 286#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 289#L566-3 [2018-11-23 08:36:52,523 INFO L796 eck$LassoCheckResult]: Loop: 289#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 287#L566-1 assume !!(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8);append_~x.base, append_~x.offset := append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem7.base, append_#t~mem7.offset; 289#L566-3 [2018-11-23 08:36:52,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2018-11-23 08:36:52,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2018-11-23 08:36:52,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:52,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2018-11-23 08:36:52,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:52,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:36:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:36:52,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:36:52,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:36:52,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:52,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:36:52,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 08:36:52,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 08:36:52,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 08:36:52,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 08:36:52,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 08:36:52,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 08:36:52,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 08:36:52,879 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,885 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2018-11-23 08:36:52,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 08:36:52,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 08:36:52,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 08:36:52,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 08:36:52,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:36:52,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 08:36:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:36:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:36:52,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-23 08:36:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 08:36:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 08:36:52,993 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 14 states. [2018-11-23 08:36:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:53,122 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 08:36:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:36:53,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-23 08:36:53,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:53,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 08:36:53,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 08:36:53,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 08:36:53,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2018-11-23 08:36:53,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:36:53,125 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 08:36:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2018-11-23 08:36:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 08:36:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 08:36:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 08:36:53,127 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 08:36:53,127 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 08:36:53,127 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 08:36:53,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-11-23 08:36:53,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:53,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:53,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:53,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:53,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 08:36:53,130 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 421#L574 assume !(main_~n~0 < 1); 410#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 414#new_llENTRY ~n := #in~n; 425#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 409#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 415#new_llENTRY ~n := #in~n; 426#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 427#new_llFINAL assume true; 424#new_llEXIT >#53#return; 413#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 408#new_llFINAL assume true; 411#new_llEXIT >#57#return; 416#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 417#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 412#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 405#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 404#lengthENTRY [2018-11-23 08:36:53,130 INFO L796 eck$LassoCheckResult]: Loop: 404#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 407#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 406#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 404#lengthENTRY [2018-11-23 08:36:53,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:53,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2018-11-23 08:36:53,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:53,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:36:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:36:53,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:36:53,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 08:36:53,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:36:53,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2018-11-23 08:36:53,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:53,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:53,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:53,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:36:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:36:53,224 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 08:36:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:36:53,244 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 08:36:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:36:53,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2018-11-23 08:36:53,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:53,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 08:36:53,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 08:36:53,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 08:36:53,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-11-23 08:36:53,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:36:53,246 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 08:36:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-11-23 08:36:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-11-23 08:36:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 08:36:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 08:36:53,250 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 08:36:53,250 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 08:36:53,250 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 08:36:53,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-23 08:36:53,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 08:36:53,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:36:53,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:36:53,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:36:53,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 08:36:53,251 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 499#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 500#L574 assume !(main_~n~0 < 1); 485#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 493#new_llENTRY ~n := #in~n; 507#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 484#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 494#new_llENTRY ~n := #in~n; 508#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 509#new_llFINAL assume true; 505#new_llEXIT >#53#return; 506#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 513#new_llFINAL assume true; 510#new_llEXIT >#57#return; 495#L577-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; 496#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 511#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 497#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 498#L566-4 call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; 491#L569 main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 488#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 487#lengthENTRY [2018-11-23 08:36:53,251 INFO L796 eck$LassoCheckResult]: Loop: 487#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 490#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 489#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 487#lengthENTRY [2018-11-23 08:36:53,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2018-11-23 08:36:53,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:53,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:36:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 3 times [2018-11-23 08:36:53,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:53,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:36:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:36:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2018-11-23 08:36:53,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:36:53,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:36:53,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:36:53,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:36:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:36:53,661 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2018-11-23 08:36:53,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:53,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:53,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:53,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:53,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:53,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:104 [2018-11-23 08:36:54,297 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 143 [2018-11-23 08:36:54,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:54,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:54,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 08:36:54,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:214, output treesize:218 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #53#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #57#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [?] assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [?] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [?] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; [?] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- [2018-11-23 08:36:54,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 08:36:54 BoogieIcfgContainer [2018-11-23 08:36:54,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 08:36:54,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:36:54,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:36:54,685 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:36:54,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:50" (3/4) ... [2018-11-23 08:36:54,690 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #53#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #57#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [?] assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [?] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [?] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; [?] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- [2018-11-23 08:36:54,750 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f6bcd1aa-7998-4979-a2e9-d5ee01e84b64/bin-2019/uautomizer/witness.graphml [2018-11-23 08:36:54,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:36:54,751 INFO L168 Benchmark]: Toolchain (without parser) took 4591.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -350.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:36:54,751 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:36:54,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:54,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.11 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-23 08:36:54,752 INFO L168 Benchmark]: Boogie Preprocessor took 23.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:54,753 INFO L168 Benchmark]: RCFGBuilder took 257.89 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: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:54,753 INFO L168 Benchmark]: BuchiAutomizer took 3874.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -218.6 MB). Peak memory consumption was 364.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:36:54,754 INFO L168 Benchmark]: Witness Printer took 64.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:36:54,756 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.11 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. * Boogie Preprocessor took 23.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.89 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: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3874.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -218.6 MB). Peak memory consumption was 364.3 MB. Max. memory is 11.5 GB. * Witness Printer took 64.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 86 SDtfs, 45 SDslu, 289 SDs, 0 SdLazy, 212 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf100 lsp95 ukn24 mio100 lsp46 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 81ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {x=0, x=0, y_length=0, NULL=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@287ad5ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56b81992=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@659756=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@659756=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2317fcd2=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f3a5e03=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c345176=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e68c7a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e68c7a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56b81992=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7eff8370=0, x=0, y=0, n=0, NULL=0, y=0, xs=2, \result=0, \result=0, NULL=0, xs=0, xs=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2317fcd2=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@287ad5ed=0, x=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #53#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #57#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [?] assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [?] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [?] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; [?] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #53#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #57#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset;havoc append_#res.base, append_#res.offset;havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset;append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset;append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [?] assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [?] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [?] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; [?] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8);append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset;main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574-L576] assume !(main_~n~0 < 1); [L577] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L577] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L577] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L577] havoc main_#t~ret9.base, main_#t~ret9.offset; [L578] append_#in~x.base, append_#in~x.offset, append_#in~y.base, append_#in~y.offset := main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset; [L578] havoc append_#res.base, append_#res.offset; [L578] havoc append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem6.base, append_#t~mem6.offset, append_~x.base, append_~x.offset, append_~y.base, append_~y.offset, append_~s~0.base, append_~s~0.offset; [L561-L570] append_~x.base, append_~x.offset := append_#in~x.base, append_#in~x.offset; [L561-L570] append_~y.base, append_~y.offset := append_#in~y.base, append_#in~y.offset; [L563-L564] assume !(append_~x.base == 0 && append_~x.offset == 0); [L565] append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; [L566] call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); [L566-L567] assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0); [L566] havoc append_#t~mem6.base, append_#t~mem6.offset; [L568] call write~$Pointer$(append_~y.base, append_~y.offset, append_~x.base, 4 + append_~x.offset, 8); [L569] append_#res.base, append_#res.offset := append_~s~0.base, append_~s~0.offset; [L578] main_#t~ret10.base, main_#t~ret10.offset := append_#res.base, append_#res.offset; [L578] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L578] havoc main_#t~ret10.base, main_#t~ret10.offset; [L579] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L573] main_~n~0 := main_#t~nondet8; [L573] havoc main_#t~nondet8; [L574] COND FALSE !(main_~n~0 < 1) [L577] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call main_#t~ret9 := new_ll(main_~n~0); [L577] main_~x~0 := main_#t~ret9; [L577] havoc main_#t~ret9; [L578] append_#in~x, append_#in~y := main_~x~0, main_~x~0; [L578] havoc append_#res; [L578] havoc append_#t~mem7, append_#t~mem6, append_~x, append_~y, append_~s~0; [L561-L570] append_~x := append_#in~x; [L561-L570] append_~y := append_#in~y; [L563] COND FALSE !(append_~x == { base: 0, offset: 0 }) [L565] append_~s~0 := append_~x; [L566] FCALL call append_#t~mem6 := read~$Pointer$({ base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L566-L567] COND TRUE !(append_#t~mem6 != { base: 0, offset: 0 }) [L566] havoc append_#t~mem6; [L568] FCALL call write~$Pointer$(append_~y, { base: append_~x!base, offset: 4 + append_~x!offset }, 8); [L569] append_#res := append_~s~0; [L578] main_#t~ret10 := append_#res; [L578] main_~y~0 := main_#t~ret10; [L578] havoc main_#t~ret10; [L579] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet8; [L573] havoc #t~nondet8; [L574] COND FALSE !(~n~0 < 1) [L577] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L577] RET call #t~ret9 := new_ll(~n~0); [L577] ~x~0 := #t~ret9; [L577] havoc #t~ret9; [L561-L570] ~x := #in~x; [L561-L570] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] ~s~0 := ~x; [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L566-L567] COND TRUE !(#t~mem6 != { base: 0, offset: 0 }) [L566] havoc #t~mem6; [L568] FCALL call write~$Pointer$(~y, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L569] #res := ~s~0; [L578] ~y~0 := #t~ret10; [L578] havoc #t~ret10; [L579] CALL call #t~ret11 := length(~y~0); [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) [L577] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L577] RET, EXPR new_ll(n) [L577] node_t* x = new_ll(n); [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [L578] node_t* y = append(x, x); [L579] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...