./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/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_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/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_1759087f-f9af-4afc-a35c-193b28916011/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-5842f4b [2018-11-18 12:30:43,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:30:43,275 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:30:43,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:30:43,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:30:43,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:30:43,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:30:43,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:30:43,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:30:43,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:30:43,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:30:43,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:30:43,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:30:43,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:30:43,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:30:43,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:30:43,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:30:43,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:30:43,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:30:43,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:30:43,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:30:43,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:30:43,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:30:43,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:30:43,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:30:43,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:30:43,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:30:43,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:30:43,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:30:43,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:30:43,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:30:43,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:30:43,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:30:43,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:30:43,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:30:43,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:30:43,305 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:30:43,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:30:43,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:30:43,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:30:43,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:30:43,317 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:30:43,317 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:30:43,317 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:30:43,317 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:30:43,317 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:30:43,317 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:30:43,318 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:30:43,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:30:43,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:30:43,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:30:43,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:30:43,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:30:43,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:30:43,319 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:30:43,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:30:43,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:30:43,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:30:43,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:30:43,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:30:43,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:30:43,320 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:30:43,321 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:30:43,321 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_1759087f-f9af-4afc-a35c-193b28916011/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-18 12:30:43,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:30:43,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:30:43,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:30:43,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:30:43,356 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:30:43,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-18 12:30:43,399 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/data/84881e026/6185f488cf364b5eab218c6a6de78274/FLAG8d1f9df62 [2018-11-18 12:30:43,829 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:30:43,830 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-18 12:30:43,837 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/data/84881e026/6185f488cf364b5eab218c6a6de78274/FLAG8d1f9df62 [2018-11-18 12:30:43,846 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/bin-2019/uautomizer/data/84881e026/6185f488cf364b5eab218c6a6de78274 [2018-11-18 12:30:43,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:30:43,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:30:43,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:30:43,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:30:43,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:30:43,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:30:43" (1/1) ... [2018-11-18 12:30:43,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab0bb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:43, skipping insertion in model container [2018-11-18 12:30:43,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:30:43" (1/1) ... [2018-11-18 12:30:43,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:30:43,885 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:30:44,064 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:30:44,071 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:30:44,150 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:30:44,186 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:30:44,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44 WrapperNode [2018-11-18 12:30:44,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:30:44,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:30:44,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:30:44,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:30:44,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:30:44,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:30:44,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:30:44,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:30:44,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... [2018-11-18 12:30:44,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:30:44,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:30:44,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:30:44,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:30:44,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/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-18 12:30:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:30:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:30:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:30:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:30:44,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:30:44,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:30:44,514 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:30:44,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:30:44 BoogieIcfgContainer [2018-11-18 12:30:44,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:30:44,515 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:30:44,515 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:30:44,518 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:30:44,518 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:30:44,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:30:43" (1/3) ... [2018-11-18 12:30:44,519 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e8ab7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:30:44, skipping insertion in model container [2018-11-18 12:30:44,519 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:30:44,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:30:44" (2/3) ... [2018-11-18 12:30:44,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e8ab7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:30:44, skipping insertion in model container [2018-11-18 12:30:44,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:30:44,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:30:44" (3/3) ... [2018-11-18 12:30:44,521 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-18 12:30:44,555 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:30:44,556 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:30:44,556 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:30:44,556 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:30:44,556 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:30:44,556 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:30:44,556 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:30:44,556 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:30:44,556 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:30:44,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 12:30:44,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:30:44,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:44,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:44,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:30:44,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:30:44,586 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:30:44,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 12:30:44,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:30:44,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:44,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:44,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:30:44,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:30:44,593 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 8#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 14#L639-3true [2018-11-18 12:30:44,593 INFO L796 eck$LassoCheckResult]: Loop: 14#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 6#L630true assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 9#L630-2true call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 16#L625true assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 11#L639-1true assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 14#L639-3true [2018-11-18 12:30:44,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:30:44,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:44,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:44,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:44,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:44,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2018-11-18 12:30:44,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:44,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:44,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:44,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2018-11-18 12:30:44,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:44,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:44,822 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-18 12:30:44,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:30:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:30:45,309 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2018-11-18 12:30:45,702 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 12:30:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:30:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:30:45,712 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-18 12:30:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:45,751 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-18 12:30:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:30:45,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-18 12:30:45,754 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 12:30:45,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 20 transitions. [2018-11-18 12:30:45,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 12:30:45,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 12:30:45,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-18 12:30:45,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:30:45,758 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 12:30:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-18 12:30:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-18 12:30:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 12:30:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 12:30:45,783 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 12:30:45,783 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 12:30:45,783 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:30:45,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 12:30:45,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:30:45,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:45,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:45,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:30:45,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:30:45,785 INFO L794 eck$LassoCheckResult]: Stem: 59#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 54#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 55#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 63#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 50#L630-2 [2018-11-18 12:30:45,785 INFO L796 eck$LassoCheckResult]: Loop: 50#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 51#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 56#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 58#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 61#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 50#L630-2 [2018-11-18 12:30:45,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-11-18 12:30:45,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:45,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:45,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2018-11-18 12:30:45,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:45,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:45,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2018-11-18 12:30:45,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:45,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:45,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:45,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:30:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:46,316 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2018-11-18 12:30:46,977 WARN L180 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-18 12:30:47,230 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2018-11-18 12:30:47,337 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:30:47,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:30:47,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:30:47,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:30:47,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:30:47,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:30:47,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:30:47,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:30:47,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-11-18 12:30:47,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:30:47,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:30:47,361 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-18 12:30:47,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,412 WARN L180 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2018-11-18 12:30:48,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-18 12:30:48,414 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-18 12:30:48,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,420 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-18 12:30:48,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,422 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-18 12:30:48,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,427 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-18 12:30:48,428 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-18 12:30:48,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,433 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-18 12:30:48,434 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-18 12:30:48,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,436 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-18 12:30:48,438 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-18 12:30:48,439 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-18 12:30:48,440 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-18 12:30:48,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,446 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-18 12:30:48,447 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-18 12:30:48,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,449 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-18 12:30:48,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:48,453 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-18 12:30:48,676 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-18 12:30:48,904 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-18 12:30:50,807 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2018-11-18 12:30:50,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:30:50,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:30:50,892 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-18 12:30:50,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:50,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:50,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:50,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:50,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:50,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:50,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:50,906 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-18 12:30:50,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:50,906 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:30:50,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:50,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:50,909 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:30:50,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:50,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:50,919 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-18 12:30:50,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:50,920 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:30:50,920 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-18 12:30:50,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:51,237 INFO L402 nArgumentSynthesizer]: We have 176 Motzkin's Theorem applications. [2018-11-18 12:30:51,237 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-18 12:30:52,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,621 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-18 12:30:52,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:30:52,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,632 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-18 12:30:52,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,635 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-18 12:30:52,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,637 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-18 12:30:52,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,640 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-18 12:30:52,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,640 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:30:52,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,641 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:30:52,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:30:52,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,652 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-18 12:30:52,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,654 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-18 12:30:52,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:30:52,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:30:52,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,666 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-18 12:30:52,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,668 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-18 12:30:52,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,670 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-18 12:30:52,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,671 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-18 12:30:52,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,673 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-18 12:30:52,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,674 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-18 12:30:52,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,676 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-18 12:30:52,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,678 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-18 12:30:52,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,679 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-18 12:30:52,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,681 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-18 12:30:52,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,683 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-18 12:30:52,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,684 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-18 12:30:52,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:30:52,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:30:52,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:30:52,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:30:52,686 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-18 12:30:52,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:30:52,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:30:52,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:30:52,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:30:52,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:30:52,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:30:52,691 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:30:52,698 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:30:52,698 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 12:30:52,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:30:52,700 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:30:52,701 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:30:52,701 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2018-11-18 12:30:52,745 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 12:30:52,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:52,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:52,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:52,815 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-18 12:30:52,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:30:52,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 12:30:52,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2018-11-18 12:30:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:30:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:30:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 12:30:52,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-18 12:30:52,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:30:52,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 12:30:52,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:30:52,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 12:30:52,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:30:52,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-11-18 12:30:52,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:52,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 19 states and 25 transitions. [2018-11-18 12:30:52,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 12:30:52,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:30:52,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-11-18 12:30:52,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:30:52,854 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-18 12:30:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-11-18 12:30:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-18 12:30:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 12:30:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-18 12:30:52,855 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 12:30:52,855 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 12:30:52,855 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:30:52,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-18 12:30:52,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:52,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:52,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:52,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:30:52,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:30:52,858 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 172#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 173#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 183#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 185#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 169#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 176#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 177#L639-4 assume !(main_~length~0 > 0); 181#L652-2 [2018-11-18 12:30:52,858 INFO L796 eck$LassoCheckResult]: Loop: 181#L652-2 assume true; 182#L652 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 181#L652-2 [2018-11-18 12:30:52,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2018-11-18 12:30:52,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:52,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:52,880 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-18 12:30:52,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:30:52,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:30:52,881 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:30:52,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2247, now seen corresponding path program 1 times [2018-11-18 12:30:52,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:52,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:30:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:30:52,973 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 12:30:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:52,988 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-18 12:30:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:30:52,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-18 12:30:52,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:52,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-11-18 12:30:52,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:30:52,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:30:52,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-18 12:30:52,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:30:52,990 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-18 12:30:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-18 12:30:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-18 12:30:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 12:30:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-18 12:30:52,992 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 12:30:52,992 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 12:30:52,992 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:30:52,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-18 12:30:52,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:52,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:52,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:52,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:30:52,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:30:52,996 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 213#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 214#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 227#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 230#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 216#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 221#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 222#L639-4 assume main_~length~0 > 0; 219#L644 assume !(main_~length~0 < 0); 220#L644-2 call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 226#L652-2 [2018-11-18 12:30:52,997 INFO L796 eck$LassoCheckResult]: Loop: 226#L652-2 assume true; 229#L652 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 226#L652-2 [2018-11-18 12:30:52,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2018-11-18 12:30:52,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:52,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2247, now seen corresponding path program 2 times [2018-11-18 12:30:53,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1294321958, now seen corresponding path program 1 times [2018-11-18 12:30:53,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:30:53,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:53,068 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-18 12:30:53,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:30:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:30:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:30:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:30:53,139 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 12:30:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:53,159 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-18 12:30:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:30:53,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2018-11-18 12:30:53,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:53,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 32 transitions. [2018-11-18 12:30:53,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 12:30:53,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 12:30:53,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-18 12:30:53,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:30:53,161 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 12:30:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-18 12:30:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-11-18 12:30:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 12:30:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-18 12:30:53,163 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:30:53,163 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:30:53,163 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:30:53,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-18 12:30:53,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:53,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:53,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:53,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:30:53,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:30:53,164 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 279#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 280#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 287#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 274#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 275#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 283#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 284#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 288#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 291#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 290#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 281#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 282#L639-4 assume main_~length~0 > 0; 277#L644 assume !(main_~length~0 < 0); 278#L644-2 call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 286#L652-2 [2018-11-18 12:30:53,164 INFO L796 eck$LassoCheckResult]: Loop: 286#L652-2 assume true; 289#L652 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 286#L652-2 [2018-11-18 12:30:53,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2018-11-18 12:30:53,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:30:53,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:53,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1759087f-f9af-4afc-a35c-193b28916011/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-18 12:30:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:53,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:53,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-18 12:30:53,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:30:53,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:30:53,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-18 12:30:53,341 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-18 12:30:53,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 12:30:53,360 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 18 treesize of output 17 [2018-11-18 12:30:53,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:30:53,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:30:53,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:30:53,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:30:53,391 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-11-18 12:30:53,408 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-18 12:30:53,410 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-18 12:30:53,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:30:53,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:30:53,412 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-18 12:30:53,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 12:30:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:30:53,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:30:53,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-18 12:30:53,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:30:53,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2247, now seen corresponding path program 3 times [2018-11-18 12:30:53,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:30:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:30:53,544 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-18 12:30:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:53,609 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 12:30:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:30:53,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2018-11-18 12:30:53,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:53,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 12:30:53,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:30:53,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 12:30:53,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-18 12:30:53,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:30:53,611 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 12:30:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-18 12:30:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 12:30:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 12:30:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 12:30:53,613 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 12:30:53,613 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 12:30:53,613 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:30:53,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-18 12:30:53,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-18 12:30:53,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:30:53,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:30:53,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:30:53,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:30:53,614 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 373#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;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 374#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 381#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 384#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 370#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 377#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 378#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 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 382#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 367#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 368#L625 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 375#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 376#L639-4 assume main_~length~0 > 0; 371#L644 assume !(main_~length~0 < 0); 372#L644-2 call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 380#L652-2 [2018-11-18 12:30:53,614 INFO L796 eck$LassoCheckResult]: Loop: 380#L652-2 assume true; 383#L652 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);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;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 380#L652-2 [2018-11-18 12:30:53,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2018-11-18 12:30:53,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:30:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2247, now seen corresponding path program 4 times [2018-11-18 12:30:53,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:53,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1875287808, now seen corresponding path program 1 times [2018-11-18 12:30:53,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:30:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:30:58,046 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 318 DAG size of output: 249 [2018-11-18 12:30:58,922 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-18 12:30:58,924 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:30:58,924 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:30:58,924 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:30:58,924 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:30:58,924 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:30:58,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:30:58,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:30:58,924 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:30:58,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration6_Lasso [2018-11-18 12:30:58,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:30:58,925 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:30:58,928 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-18 12:30:58,935 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-18 12:30:58,937 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-18 12:30:58,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-18 12:30:58,986 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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,995 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-18 12:30:58,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-18 12:30:58,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-18 12:30:58,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-18 12:30:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:59,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-18 12:30:59,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-18 12:30:59,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-18 12:30:59,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:59,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-18 12:30:59,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-18 12:30:59,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-18 12:30:59,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:30:59,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-18 12:30:59,011 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-18 12:30:59,011 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-18 12:30:59,012 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-18 12:30:59,013 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-18 12:30:59,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-18 12:30:59,015 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-18 12:30:59,362 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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) 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-18 12:30:59,364 INFO L168 Benchmark]: Toolchain (without parser) took 15515.55 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 559.4 MB). Free memory was 956.6 MB in the beginning and 1.4 GB in the end (delta: -480.4 MB). Peak memory consumption was 599.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:59,364 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:30:59,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:59,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:59,366 INFO L168 Benchmark]: Boogie Preprocessor took 18.29 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-18 12:30:59,366 INFO L168 Benchmark]: RCFGBuilder took 272.98 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:59,366 INFO L168 Benchmark]: BuchiAutomizer took 14848.37 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -345.1 MB). Peak memory consumption was 601.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:59,369 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.29 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 272.98 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14848.37 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -345.1 MB). Peak memory consumption was 601.5 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...