./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd0b9292151174331f3cf63e5ad3d651d29dfbcc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:41:17,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:41:17,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:41:17,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:41:17,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:41:17,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:41:17,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:41:17,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:41:17,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:41:17,447 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:41:17,448 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:41:17,448 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:41:17,449 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:41:17,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:41:17,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:41:17,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:41:17,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:41:17,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:41:17,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:41:17,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:41:17,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:41:17,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:41:17,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:41:17,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:41:17,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:41:17,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:41:17,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:41:17,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:41:17,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:41:17,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:41:17,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:41:17,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:41:17,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:41:17,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:41:17,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:41:17,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:41:17,469 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:41:17,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:41:17,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:41:17,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:41:17,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:41:17,483 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:41:17,483 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:41:17,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:41:17,483 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:41:17,483 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:41:17,483 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:41:17,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:41:17,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:41:17,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:41:17,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:41:17,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:41:17,484 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:41:17,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:41:17,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:41:17,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:41:17,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:41:17,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:41:17,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:41:17,485 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:41:17,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:41:17,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:41:17,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:41:17,487 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:41:17,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:41:17,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:41:17,487 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:41:17,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:41:17,489 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_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-11-10 12:41:17,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:41:17,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:41:17,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:41:17,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:41:17,529 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:41:17,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-10 12:41:17,568 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/data/947e0bfde/255dfe428e034d7fb41b63baa9682662/FLAG34760935d [2018-11-10 12:41:17,954 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:41:17,954 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-10 12:41:17,963 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/data/947e0bfde/255dfe428e034d7fb41b63baa9682662/FLAG34760935d [2018-11-10 12:41:17,975 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/data/947e0bfde/255dfe428e034d7fb41b63baa9682662 [2018-11-10 12:41:17,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:41:17,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:41:17,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:41:17,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:41:17,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:41:17,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:41:17" (1/1) ... [2018-11-10 12:41:17,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0f78a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:17, skipping insertion in model container [2018-11-10 12:41:17,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:41:17" (1/1) ... [2018-11-10 12:41:17,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:41:18,027 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:41:18,247 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:41:18,255 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:41:18,285 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:41:18,317 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:41:18,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18 WrapperNode [2018-11-10 12:41:18,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:41:18,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:41:18,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:41:18,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:41:18,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:41:18,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:41:18,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:41:18,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:41:18,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... [2018-11-10 12:41:18,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:41:18,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:41:18,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:41:18,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:41:18,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:41:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:41:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:41:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:41:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:41:18,715 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:41:18,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:18 BoogieIcfgContainer [2018-11-10 12:41:18,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:41:18,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:41:18,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:41:18,719 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:41:18,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:41:18,720 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:41:17" (1/3) ... [2018-11-10 12:41:18,720 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19306605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:41:18, skipping insertion in model container [2018-11-10 12:41:18,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:41:18,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:18" (2/3) ... [2018-11-10 12:41:18,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19306605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:41:18, skipping insertion in model container [2018-11-10 12:41:18,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:41:18,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:18" (3/3) ... [2018-11-10 12:41:18,722 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-10 12:41:18,759 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:41:18,760 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:41:18,760 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:41:18,760 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:41:18,760 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:41:18,760 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:41:18,760 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:41:18,760 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:41:18,760 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:41:18,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 12:41:18,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 12:41:18,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:41:18,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:41:18,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:41:18,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:18,792 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:41:18,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 12:41:18,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 12:41:18,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:41:18,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:41:18,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:41:18,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:18,801 INFO L793 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 39#L637true SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 42#L637-1true main_~length~0 := 0; 43#L639-3true [2018-11-10 12:41:18,801 INFO L795 eck$LassoCheckResult]: Loop: 43#L639-3true assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 32#L629true SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 12#L629-1true SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 14#L629-2true havoc append_#t~mem2.base, append_#t~mem2.offset; 8#L630true SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 9#L630-1true assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 37#L630-3true SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 40#L630-4true havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 23#L633true SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 25#L633-1true assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 35#L639-1true assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 43#L639-3true [2018-11-10 12:41:18,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 12:41:18,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:18,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:18,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:18,901 INFO L82 PathProgramCache]: Analyzing trace with hash 619840402, now seen corresponding path program 1 times [2018-11-10 12:41:18,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:18,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:18,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:18,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1394771889, now seen corresponding path program 1 times [2018-11-10 12:41:18,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:18,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:18,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:19,668 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-11-10 12:41:19,799 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-10 12:41:19,914 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:41:19,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:41:19,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:41:19,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:41:19,915 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:41:19,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:41:19,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:41:19,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:41:19,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration1_Lasso [2018-11-10 12:41:19,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:41:19,916 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:41:19,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:19,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,317 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-11-10 12:41:20,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-10 12:41:20,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-10 12:41:20,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-10 12:41:20,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:20,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-10 12:41:20,721 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:41:20,725 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:41:20,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,816 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:41:20,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:41:20,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,870 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:41:20,870 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:41:20,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,877 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 12:41:20,877 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:41:20,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,959 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:41:20,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,963 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 12:41:20,963 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:41:20,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:20,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:20,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:20,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:20,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:20,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:20,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:20,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:20,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:20,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:20,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:20,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:21,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:21,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:21,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:21,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:21,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:21,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:21,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:21,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:21,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:21,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:21,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:21,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:21,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:21,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:21,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:21,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:21,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:21,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:21,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:21,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:21,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:21,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:21,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:21,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:21,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:21,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:21,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:21,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:21,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:21,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:21,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:21,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:21,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:21,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:21,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:21,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:21,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:21,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:21,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:21,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:41:21,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:21,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:21,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:21,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:41:21,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:41:21,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:41:21,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:41:21,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:41:21,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:41:21,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:41:21,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:41:21,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:41:21,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:41:21,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:41:21,025 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 12:41:21,025 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:41:21,027 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:41:21,028 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:41:21,029 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:41:21,029 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 37 Supporting invariants [] [2018-11-10 12:41:21,042 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 12:41:21,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:21,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:21,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:21,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:41:21,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states. Second operand 3 states. [2018-11-10 12:41:21,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states.. Second operand 3 states. Result 107 states and 122 transitions. Complement of second has 5 states. [2018-11-10 12:41:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 12:41:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:41:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-10 12:41:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 11 letters. [2018-11-10 12:41:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:41:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 15 letters. Loop has 11 letters. [2018-11-10 12:41:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:41:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 22 letters. [2018-11-10 12:41:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:41:21,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 122 transitions. [2018-11-10 12:41:21,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:21,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 53 states and 59 transitions. [2018-11-10 12:41:21,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 12:41:21,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-10 12:41:21,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2018-11-10 12:41:21,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:41:21,259 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 12:41:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2018-11-10 12:41:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-10 12:41:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 12:41:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-10 12:41:21,279 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 12:41:21,280 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 12:41:21,280 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:41:21,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2018-11-10 12:41:21,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:21,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:41:21,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:41:21,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:21,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:21,282 INFO L793 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 241#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 274#L637-1 main_~length~0 := 0; 275#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 266#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 242#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 243#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 231#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 232#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 235#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 270#L630-4 havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 253#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 254#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 258#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 268#L639-4 assume !(main_~length~0 > 0); 239#L652-2 [2018-11-10 12:41:21,282 INFO L795 eck$LassoCheckResult]: Loop: 239#L652-2 assume true; 229#L652 assume !!(main_~length~0 > 0); 230#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 260#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 263#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 225#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 226#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 228#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 257#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 239#L652-2 [2018-11-10 12:41:21,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash -288255605, now seen corresponding path program 1 times [2018-11-10 12:41:21,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:21,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:21,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:21,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:41:21,342 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:41:21,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 1 times [2018-11-10 12:41:21,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:21,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:41:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:41:21,479 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:41:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:21,496 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-11-10 12:41:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:41:21,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 80 transitions. [2018-11-10 12:41:21,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:21,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 80 transitions. [2018-11-10 12:41:21,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 12:41:21,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 12:41:21,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 80 transitions. [2018-11-10 12:41:21,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:41:21,499 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-10 12:41:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 80 transitions. [2018-11-10 12:41:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-11-10 12:41:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 12:41:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-10 12:41:21,502 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-10 12:41:21,502 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-10 12:41:21,502 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:41:21,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2018-11-10 12:41:21,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:21,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:41:21,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:41:21,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:21,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:21,504 INFO L793 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 372#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 405#L637-1 main_~length~0 := 0; 406#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 397#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 373#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 374#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 362#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 363#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 366#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 402#L630-4 havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 384#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 385#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 389#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 399#L639-4 assume main_~length~0 > 0; 382#L644 assume !(main_~length~0 < 0); 383#L644-2 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644-2 379#L647 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L647 380#L647-1 main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; 381#L648 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L648 404#L648-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 377#L649 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L649 378#L649-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 370#L652-2 [2018-11-10 12:41:21,505 INFO L795 eck$LassoCheckResult]: Loop: 370#L652-2 assume true; 360#L652 assume !!(main_~length~0 > 0); 361#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 391#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 394#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 357#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 358#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 359#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 388#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 370#L652-2 [2018-11-10 12:41:21,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1361066782, now seen corresponding path program 1 times [2018-11-10 12:41:21,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:21,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:21,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 2 times [2018-11-10 12:41:21,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:21,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:21,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1490895842, now seen corresponding path program 1 times [2018-11-10 12:41:21,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:21,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:21,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:41:21,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:21,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:41:21,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:41:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:41:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:41:21,704 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-10 12:41:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:21,728 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-10 12:41:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:41:21,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 120 transitions. [2018-11-10 12:41:21,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:21,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 88 states and 95 transitions. [2018-11-10 12:41:21,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 12:41:21,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 12:41:21,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 95 transitions. [2018-11-10 12:41:21,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:41:21,732 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-10 12:41:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 95 transitions. [2018-11-10 12:41:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-11-10 12:41:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 12:41:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-10 12:41:21,735 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 12:41:21,735 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 12:41:21,735 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:41:21,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2018-11-10 12:41:21,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:21,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:41:21,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:41:21,737 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:21,737 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:21,737 INFO L793 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 544#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 577#L637-1 main_~length~0 := 0; 578#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 570#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 547#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 548#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 536#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 537#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 540#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 575#L630-4 havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 558#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 559#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 562#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 572#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 569#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 545#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 546#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 534#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 535#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 538#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 574#L630-4 havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 556#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 557#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 561#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 571#L639-4 assume main_~length~0 > 0; 554#L644 assume !(main_~length~0 < 0); 555#L644-2 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644-2 551#L647 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L647 552#L647-1 main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; 553#L648 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L648 576#L648-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 549#L649 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L649 550#L649-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 542#L652-2 [2018-11-10 12:41:21,738 INFO L795 eck$LassoCheckResult]: Loop: 542#L652-2 assume true; 532#L652 assume !!(main_~length~0 > 0); 533#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 563#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 566#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 529#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 530#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 531#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 560#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 542#L652-2 [2018-11-10 12:41:21,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1522732919, now seen corresponding path program 1 times [2018-11-10 12:41:21,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:21,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:41:21,808 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c52a3721-fe00-49f2-88a4-3a73b419790e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:41:21,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:41:21,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:41:21,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:41:21,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:41:21,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-10 12:41:21,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2018-11-10 12:41:21,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-10 12:41:21,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-10 12:41:21,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:41:21,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-11-10 12:41:21,982 INFO L477 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 16 treesize of output 12 [2018-11-10 12:41:21,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-10 12:41:21,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:41:21,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-10 12:41:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:41:22,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:41:22,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 12:41:22,010 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:41:22,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 3 times [2018-11-10 12:41:22,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:41:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:41:22,142 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-10 12:41:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:41:22,391 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-10 12:41:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:41:22,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2018-11-10 12:41:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:22,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 67 transitions. [2018-11-10 12:41:22,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 12:41:22,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 12:41:22,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 67 transitions. [2018-11-10 12:41:22,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:41:22,395 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-11-10 12:41:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 67 transitions. [2018-11-10 12:41:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-10 12:41:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 12:41:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-10 12:41:22,398 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-10 12:41:22,398 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-10 12:41:22,398 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:41:22,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2018-11-10 12:41:22,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 12:41:22,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:41:22,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:41:22,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:22,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:41:22,400 INFO L793 eck$LassoCheckResult]: Stem: 815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 784#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 819#L637-1 main_~length~0 := 0; 820#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 821#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 825#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 824#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 823#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 822#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 812#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 817#L630-4 havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 798#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 799#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 802#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 814#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 809#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 785#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 786#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 776#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 777#L630-1 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0; 780#L631 SUMMARY for call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L631 804#L631-1 SUMMARY for call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset + 4, 4); srcloc: L631-1 807#L631-2 append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 811#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 816#L630-4 havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset; 796#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 797#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 801#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 813#L639-4 assume main_~length~0 > 0; 794#L644 assume !(main_~length~0 < 0); 795#L644-2 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644-2 791#L647 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L647 792#L647-1 main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; 793#L648 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L648 818#L648-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 789#L649 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L649 790#L649-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 782#L652-2 [2018-11-10 12:41:22,400 INFO L795 eck$LassoCheckResult]: Loop: 782#L652-2 assume true; 774#L652 assume !!(main_~length~0 > 0); 775#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 803#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 806#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 771#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 772#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 773#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 800#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 782#L652-2 [2018-11-10 12:41:22,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -453366003, now seen corresponding path program 1 times [2018-11-10 12:41:22,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:41:22,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 4 times [2018-11-10 12:41:22,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:41:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:41:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -803910445, now seen corresponding path program 1 times [2018-11-10 12:41:22,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:41:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:41:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:41:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:41:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:22,641 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-10 12:41:28,905 WARN L179 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 392 DAG size of output: 323 [2018-11-10 12:41:30,370 WARN L179 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 164 [2018-11-10 12:41:30,373 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:41:30,374 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:41:30,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:41:30,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:41:30,374 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:41:30,374 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:41:30,374 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:41:30,374 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:41:30,374 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration5_Lasso [2018-11-10 12:41:30,374 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:41:30,374 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:41:30,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,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-10 12:41:30,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,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-10 12:41:30,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,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-10 12:41:30,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:41:30,879 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 12:41:30,881 INFO L168 Benchmark]: Toolchain (without parser) took 12902.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 957.5 MB in the beginning and 1.3 GB in the end (delta: -303.5 MB). Peak memory consumption was 456.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:30,882 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:41:30,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.07 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:30,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:30,883 INFO L168 Benchmark]: Boogie Preprocessor took 22.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:41:30,884 INFO L168 Benchmark]: RCFGBuilder took 287.96 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: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:30,884 INFO L168 Benchmark]: BuchiAutomizer took 12164.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -150.5 MB). Peak memory consumption was 464.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:30,891 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.07 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.90 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 287.96 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: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12164.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -150.5 MB). Peak memory consumption was 464.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...