./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/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_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/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-0cd3be1 [2018-11-28 13:13:00,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:13:00,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:13:00,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:13:00,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:13:00,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:13:00,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:13:00,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:13:00,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:13:00,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:13:00,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:13:00,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:13:00,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:13:00,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:13:00,492 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:13:00,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:13:00,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:13:00,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:13:00,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:13:00,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:13:00,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:13:00,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:13:00,500 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:13:00,500 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:13:00,500 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:13:00,501 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:13:00,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:13:00,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:13:00,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:13:00,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:13:00,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:13:00,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:13:00,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:13:00,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:13:00,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:13:00,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:13:00,506 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:13:00,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:13:00,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:13:00,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:13:00,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:13:00,518 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:13:00,518 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:13:00,518 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:13:00,518 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:13:00,518 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:13:00,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:13:00,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:13:00,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:13:00,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:13:00,520 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:13:00,520 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:13:00,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:13:00,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:13:00,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:13:00,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:13:00,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:13:00,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:13:00,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:13:00,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:13:00,522 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_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/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-28 13:13:00,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:13:00,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:13:00,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:13:00,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:13:00,561 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:13:00,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2018-11-28 13:13:00,600 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/data/d53bec573/db47648196064cba825a3c828eade96e/FLAG1b8913be7 [2018-11-28 13:13:01,046 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:13:01,047 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca_false-termination.c.i [2018-11-28 13:13:01,055 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/data/d53bec573/db47648196064cba825a3c828eade96e/FLAG1b8913be7 [2018-11-28 13:13:01,065 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/data/d53bec573/db47648196064cba825a3c828eade96e [2018-11-28 13:13:01,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:13:01,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:13:01,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:13:01,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:13:01,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:13:01,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e7ad5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01, skipping insertion in model container [2018-11-28 13:13:01,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:13:01,100 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:13:01,276 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:13:01,285 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:13:01,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:13:01,396 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:13:01,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01 WrapperNode [2018-11-28 13:13:01,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:13:01,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:13:01,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:13:01,398 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:13:01,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:13:01,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:13:01,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:13:01,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:13:01,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... [2018-11-28 13:13:01,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:13:01,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:13:01,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:13:01,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:13:01,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2018-11-28 13:13:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2018-11-28 13:13:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:13:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:13:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:13:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:13:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure length [2018-11-28 13:13:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2018-11-28 13:13:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:13:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:13:01,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:13:01,642 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 13:13:01,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:13:01 BoogieIcfgContainer [2018-11-28 13:13:01,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:13:01,643 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:13:01,643 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:13:01,646 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:13:01,647 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:13:01,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:13:01" (1/3) ... [2018-11-28 13:13:01,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36281904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:13:01, skipping insertion in model container [2018-11-28 13:13:01,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:13:01,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:01" (2/3) ... [2018-11-28 13:13:01,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36281904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:13:01, skipping insertion in model container [2018-11-28 13:13:01,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:13:01,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:13:01" (3/3) ... [2018-11-28 13:13:01,650 INFO L375 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca_false-termination.c.i [2018-11-28 13:13:01,685 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:13:01,686 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:13:01,686 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:13:01,686 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:13:01,686 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:13:01,686 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:13:01,686 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:13:01,686 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:13:01,686 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:13:01,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-28 13:13:01,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-28 13:13:01,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:01,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:01,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:13:01,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:13:01,720 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:13:01,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-28 13:13:01,723 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-28 13:13:01,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:01,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:01,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:13:01,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:13:01,728 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-28 13:13:01,728 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-28 13:13:01,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2018-11-28 13:13:01,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:01,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:01,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:01,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:01,807 INFO L82 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2018-11-28 13:13:01,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:01,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:01,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2018-11-28 13:13:01,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:02,028 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-11-28 13:13:02,275 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:13:02,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:13:02,276 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:13:02,276 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:13:02,276 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:13:02,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:13:02,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:13:02,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:13:02,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-28 13:13:02,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:13:02,277 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:13:02,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:13:02,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:13:02,577 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:13:02,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:02,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:02,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:13:02,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:13:02,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:13:02,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:13:02,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:13:02,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:13:02,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:13:02,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:13:02,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:13:02,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:13:02,665 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:13:02,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:13:02,672 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 13:13:02,672 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 13:13:02,723 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:13:02,743 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:13:02,744 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:13:02,746 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:13:02,748 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-28 13:13:02,750 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:13:02,750 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-28 13:13:02,757 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 13:13:02,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:02,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:02,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:02,865 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-28 13:13:02,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2018-11-28 13:13:02,964 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-28 13:13:02,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 13:13:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:13:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 13:13:02,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 13:13:02,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:02,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 13:13:02,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:02,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 13:13:02,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:13:02,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2018-11-28 13:13:02,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:02,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2018-11-28 13:13:02,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 13:13:02,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 13:13:02,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2018-11-28 13:13:02,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:02,979 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-28 13:13:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2018-11-28 13:13:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 13:13:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 13:13:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 13:13:02,999 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 13:13:02,999 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 13:13:02,999 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:13:02,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 13:13:03,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:03,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:03,001 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:03,001 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:13:03,001 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-28 13:13:03,001 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-28 13:13:03,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2018-11-28 13:13:03,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:13:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:13:03,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:03,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2018-11-28 13:13:03,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:13:03,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:13:03,123 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 13:13:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:03,149 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-28 13:13:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:13:03,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-28 13:13:03,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2018-11-28 13:13:03,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 13:13:03,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 13:13:03,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-28 13:13:03,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:03,152 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 13:13:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-28 13:13:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-28 13:13:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 13:13:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-28 13:13:03,154 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 13:13:03,154 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 13:13:03,154 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:13:03,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-28 13:13:03,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:03,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:03,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:03,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:13:03,157 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#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; 223#L574 assume !(main_~n~0 < 1); 213#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 215#new_llENTRY ~n := #in~n; 225#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); 205#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 216#new_llENTRY ~n := #in~n; 226#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 204#new_llFINAL assume true; 206#new_llEXIT >#53#return; 212#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; 214#new_llFINAL assume true; 227#new_llEXIT >#57#return; 217#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; 218#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 221#L566-3 [2018-11-28 13:13:03,157 INFO L796 eck$LassoCheckResult]: Loop: 221#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 219#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; 221#L566-3 [2018-11-28 13:13:03,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,157 INFO L82 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2018-11-28 13:13:03,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2018-11-28 13:13:03,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2018-11-28 13:13:03,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:03,346 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-28 13:13:03,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:03,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:03,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:03,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:03,397 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-28 13:13:03,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-28 13:13:03,460 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-28 13:13:03,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,466 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-28 13:13:03,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:13:03,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,479 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-28 13:13:03,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:13:03,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,484 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-28 13:13:03,484 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2018-11-28 13:13:03,501 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-28 13:13:03,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:13:03,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,509 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-28 13:13:03,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:13:03,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:03,513 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-28 13:13:03,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-28 13:13:03,524 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-28 13:13:03,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:03,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-28 13:13:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:13:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:13:03,572 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 14 states. [2018-11-28 13:13:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:03,685 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-28 13:13:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:13:03,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-28 13:13:03,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2018-11-28 13:13:03,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 13:13:03,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 13:13:03,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2018-11-28 13:13:03,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:03,688 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-28 13:13:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2018-11-28 13:13:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-28 13:13:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:13:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-28 13:13:03,691 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-28 13:13:03,691 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-28 13:13:03,691 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:13:03,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-11-28 13:13:03,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:03,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:03,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:03,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:13:03,693 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 352#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; 353#L574 assume !(main_~n~0 < 1); 342#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 346#new_llENTRY ~n := #in~n; 358#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); 341#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 347#new_llENTRY ~n := #in~n; 359#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 360#new_llFINAL assume true; 357#new_llEXIT >#53#return; 345#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; 340#new_llFINAL assume true; 343#new_llEXIT >#57#return; 363#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; 362#L563 assume append_~x.base == 0 && append_~x.offset == 0;append_#res.base, append_#res.offset := append_~y.base, append_~y.offset; 344#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; 338#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 336#lengthENTRY [2018-11-28 13:13:03,693 INFO L796 eck$LassoCheckResult]: Loop: 336#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 339#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 337#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 336#lengthENTRY [2018-11-28 13:13:03,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2018-11-28 13:13:03,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:03,720 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-28 13:13:03,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:03,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:13:03,721 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:13:03,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2018-11-28 13:13:03,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:13:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:13:03,803 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-28 13:13:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:03,827 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-28 13:13:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:13:03,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2018-11-28 13:13:03,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2018-11-28 13:13:03,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 13:13:03,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 13:13:03,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-11-28 13:13:03,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:13:03,831 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 13:13:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-11-28 13:13:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-11-28 13:13:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 13:13:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 13:13:03,836 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 13:13:03,836 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 13:13:03,837 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:13:03,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-28 13:13:03,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 13:13:03,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:13:03,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:13:03,838 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-28 13:13:03,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:13:03,839 INFO L794 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#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; 432#L574 assume !(main_~n~0 < 1); 417#L577 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 425#new_llENTRY ~n := #in~n; 439#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); 416#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 426#new_llENTRY ~n := #in~n; 440#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 441#new_llFINAL assume true; 437#new_llEXIT >#53#return; 438#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; 445#new_llFINAL assume true; 442#new_llEXIT >#57#return; 427#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; 428#L563 assume !(append_~x.base == 0 && append_~x.offset == 0);append_~s~0.base, append_~s~0.offset := append_~x.base, append_~x.offset; 443#L566-3 call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~x.base, 4 + append_~x.offset, 8); 429#L566-1 assume !(append_#t~mem6.base != 0 || append_#t~mem6.offset != 0);havoc append_#t~mem6.base, append_#t~mem6.offset; 430#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; 423#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; 421#L579 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 419#lengthENTRY [2018-11-28 13:13:03,839 INFO L796 eck$LassoCheckResult]: Loop: 419#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 422#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 420#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 419#lengthENTRY [2018-11-28 13:13:03,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2018-11-28 13:13:03,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2018-11-28 13:13:03,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2018-11-28 13:13:03,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:13:04,233 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2018-11-28 13:13:04,237 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-28 13:13:04,241 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-28 13:13:04,278 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-28 13:13:04,281 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-28 13:13:04,308 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-28 13:13:04,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:104 [2018-11-28 13:13:04,853 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 146 [2018-11-28 13:13:04,856 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-28 13:13:04,861 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-28 13:13:04,940 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-28 13:13:04,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:214, output treesize:218 [2018-11-28 13:13:05,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:13:05 BoogieIcfgContainer [2018-11-28 13:13:05,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:13:05,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:13:05,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:13:05,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:13:05,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:13:01" (3/4) ... [2018-11-28 13:13:05,144 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 13:13:05,184 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_858e64e0-6ef9-4ad1-93fc-f3b0eaa479cb/bin-2019/uautomizer/witness.graphml [2018-11-28 13:13:05,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:13:05,185 INFO L168 Benchmark]: Toolchain (without parser) took 4117.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -60.1 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,186 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:13:05,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,187 INFO L168 Benchmark]: Boogie Preprocessor took 19.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:13:05,187 INFO L168 Benchmark]: RCFGBuilder took 200.07 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,187 INFO L168 Benchmark]: BuchiAutomizer took 3497.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:13:05,188 INFO L168 Benchmark]: Witness Printer took 42.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:13:05,192 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.07 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3497.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. * Witness Printer took 42.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 3 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.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. 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 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 64 SDtfs, 43 SDslu, 218 SDs, 0 SdLazy, 193 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 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: 84ms 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@6d1c212f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a695238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f154842=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f154842=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16d97c93=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44278f54=0, NULL=0, y=0, y=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40244195=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bd05915=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bd05915=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a695238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35d7e44b=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@16d97c93=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d1c212f=0, x=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution 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...