./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/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_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/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_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:30,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:30,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:30,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:30,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:30,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:30,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:30,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:30,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:30,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:30,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:30,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:30,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:30,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:30,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:30,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:30,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:30,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:30,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:30,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:30,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:30,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:30,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:30,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:30,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:30,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:30,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:30,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:30,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:30,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:30,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:30,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:30,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:30,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:30,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:30,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:30,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:10:30,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:30,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:30,156 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:30,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:30,157 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:30,157 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:30,157 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:30,157 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:30,157 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:30,158 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:30,159 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:30,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:30,159 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:10:30,159 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:30,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:30,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:10:30,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:30,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:30,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:30,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:30,160 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:10:30,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:30,161 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:30,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:30,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:30,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:30,162 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:30,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:30,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:30,164 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:30,164 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:30,165 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_245e5829-977a-4030-9124-6688078dc12e/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-10-27 06:10:30,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:30,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:30,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:30,203 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:30,203 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:30,204 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-10-27 06:10:30,251 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/data/5b14d93db/40bb7f96adc8479db525c8446db6207c/FLAGfeb424486 [2018-10-27 06:10:30,651 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:30,651 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-10-27 06:10:30,661 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/data/5b14d93db/40bb7f96adc8479db525c8446db6207c/FLAGfeb424486 [2018-10-27 06:10:30,672 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/bin-2019/uautomizer/data/5b14d93db/40bb7f96adc8479db525c8446db6207c [2018-10-27 06:10:30,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:30,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:30,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:30,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:30,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:30,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d791cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:30, skipping insertion in model container [2018-10-27 06:10:30,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:30" (1/1) ... [2018-10-27 06:10:30,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:30,732 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:30,957 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:30,964 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:30,998 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:31,030 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:31,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31 WrapperNode [2018-10-27 06:10:31,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:31,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:31,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:31,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:31,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:31,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:31,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:31,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:31,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... [2018-10-27 06:10:31,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:31,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:31,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:31,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:31,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/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-10-27 06:10:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 06:10:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 06:10:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:31,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:31,815 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:31,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31 BoogieIcfgContainer [2018-10-27 06:10:31,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:31,816 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:31,816 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:31,820 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:31,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:30" (1/3) ... [2018-10-27 06:10:31,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63368c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:31, skipping insertion in model container [2018-10-27 06:10:31,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:31" (2/3) ... [2018-10-27 06:10:31,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63368c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:31, skipping insertion in model container [2018-10-27 06:10:31,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:31,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:31" (3/3) ... [2018-10-27 06:10:31,824 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-10-27 06:10:31,874 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:31,875 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:31,875 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:31,875 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:31,875 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:31,875 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:31,876 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:31,876 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:31,876 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:31,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-10-27 06:10:31,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-10-27 06:10:31,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:31,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,920 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:31,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-10-27 06:10:31,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-10-27 06:10:31,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:31,927 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,935 INFO L793 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 39#L637true SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 42#L637-1true main_~length~0 := 0; 43#L639-3true [2018-10-27 06:10:31,937 INFO L795 eck$LassoCheckResult]: Loop: 43#L639-3true assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 32#L629true SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 12#L629-1true SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 14#L629-2true havoc append_#t~mem2.base, append_#t~mem2.offset; 8#L630true SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 9#L630-1true assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 37#L630-3true SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 40#L630-4true havoc append_#t~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; 23#L633true SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 25#L633-1true assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 35#L639-1true assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 43#L639-3true [2018-10-27 06:10:31,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-10-27 06:10:31,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash 619840402, now seen corresponding path program 1 times [2018-10-27 06:10:32,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1394771889, now seen corresponding path program 1 times [2018-10-27 06:10:32,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,658 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-10-27 06:10:33,947 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:10:34,051 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:10:34,118 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:34,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:34,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:34,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:34,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:34,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:34,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:34,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:34,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration1_Lasso [2018-10-27 06:10:34,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:34,121 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:34,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,727 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-10-27 06:10:34,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:35,201 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:35,206 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:35,208 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-10-27 06:10:35,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,216 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-10-27 06:10:35,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,221 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-10-27 06:10:35,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,238 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-10-27 06:10:35,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,246 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-10-27 06:10:35,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,248 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-10-27 06:10:35,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,254 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-10-27 06:10:35,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,256 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-10-27 06:10:35,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,263 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-10-27 06:10:35,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,269 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-10-27 06:10:35,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,271 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-10-27 06:10:35,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,278 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-10-27 06:10:35,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,280 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-10-27 06:10:35,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,287 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-10-27 06:10:35,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,289 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-10-27 06:10:35,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,295 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-10-27 06:10:35,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,297 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-10-27 06:10:35,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,304 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-10-27 06:10:35,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,310 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-10-27 06:10:35,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,312 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-10-27 06:10:35,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,319 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-10-27 06:10:35,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,321 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-10-27 06:10:35,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,326 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:35,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,326 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:35,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,329 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-10-27 06:10:35,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,332 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-10-27 06:10:35,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,345 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-10-27 06:10:35,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,347 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-10-27 06:10:35,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,356 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-10-27 06:10:35,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,362 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-10-27 06:10:35,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,364 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-10-27 06:10:35,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,375 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-10-27 06:10:35,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,378 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-10-27 06:10:35,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,380 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-10-27 06:10:35,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,387 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-10-27 06:10:35,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,389 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-10-27 06:10:35,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,393 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-10-27 06:10:35,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,398 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-10-27 06:10:35,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,421 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-10-27 06:10:35,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,430 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-10-27 06:10:35,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,431 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:35,431 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:35,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,439 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-10-27 06:10:35,439 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:10:35,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,491 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-10-27 06:10:35,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,560 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-10-27 06:10:35,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,565 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-10-27 06:10:35,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,573 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:35,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,579 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:10:35,580 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:10:35,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:35,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,620 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-10-27 06:10:35,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,625 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-10-27 06:10:35,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:35,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,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-10-27 06:10:35,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,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-10-27 06:10:35,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,649 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-10-27 06:10:35,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,651 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-10-27 06:10:35,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:35,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:35,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:35,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:35,653 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-10-27 06:10:35,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:35,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:35,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:35,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:35,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:35,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:35,666 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:35,674 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:35,674 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:10:35,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:35,677 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:35,678 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:35,678 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 37 Supporting invariants [] [2018-10-27 06:10:35,710 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:10:36,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:36,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:10:36,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states. Second operand 3 states. [2018-10-27 06:10:36,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states.. Second operand 3 states. Result 107 states and 122 transitions. Complement of second has 5 states. [2018-10-27 06:10:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:10:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-10-27 06:10:36,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 11 letters. [2018-10-27 06:10:36,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 15 letters. Loop has 11 letters. [2018-10-27 06:10:36,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 22 letters. [2018-10-27 06:10:36,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:36,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 122 transitions. [2018-10-27 06:10:36,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:36,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 53 states and 59 transitions. [2018-10-27 06:10:36,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:10:36,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-10-27 06:10:36,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2018-10-27 06:10:36,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:36,303 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-27 06:10:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2018-10-27 06:10:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-27 06:10:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:10:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-10-27 06:10:36,325 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-27 06:10:36,325 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-27 06:10:36,326 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:36,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2018-10-27 06:10:36,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:36,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,329 INFO L793 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 241#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 274#L637-1 main_~length~0 := 0; 275#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 266#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 242#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 243#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 231#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 232#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 235#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 270#L630-4 havoc append_#t~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; 253#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 254#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 258#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 268#L639-4 assume !(main_~length~0 > 0); 239#L652-2 [2018-10-27 06:10:36,329 INFO L795 eck$LassoCheckResult]: Loop: 239#L652-2 assume true; 229#L652 assume !!(main_~length~0 > 0); 230#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 260#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 263#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 225#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 226#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 228#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 257#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 239#L652-2 [2018-10-27 06:10:36,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash -288255605, now seen corresponding path program 1 times [2018-10-27 06:10:36,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:36,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:36,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:36,510 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:36,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 1 times [2018-10-27 06:10:36,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,820 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-27 06:10:36,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:36,852 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:10:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:36,922 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-10-27 06:10:36,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:36,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 80 transitions. [2018-10-27 06:10:36,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:36,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 80 transitions. [2018-10-27 06:10:36,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-10-27 06:10:36,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-10-27 06:10:36,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 80 transitions. [2018-10-27 06:10:36,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:36,926 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-10-27 06:10:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 80 transitions. [2018-10-27 06:10:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-10-27 06:10:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 06:10:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-27 06:10:36,928 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-27 06:10:36,928 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-27 06:10:36,928 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:36,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2018-10-27 06:10:36,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:36,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,933 INFO L793 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 372#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 405#L637-1 main_~length~0 := 0; 406#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 397#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 373#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 374#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 362#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 363#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 366#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 402#L630-4 havoc append_#t~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; 384#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 385#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 389#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 399#L639-4 assume main_~length~0 > 0; 382#L644 assume !(main_~length~0 < 0); 383#L644-2 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644-2 379#L647 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L647 380#L647-1 main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset; 381#L648 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L648 404#L648-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 377#L649 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L649 378#L649-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 370#L652-2 [2018-10-27 06:10:36,933 INFO L795 eck$LassoCheckResult]: Loop: 370#L652-2 assume true; 360#L652 assume !!(main_~length~0 > 0); 361#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 391#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 394#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 357#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 358#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 359#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 388#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 370#L652-2 [2018-10-27 06:10:36,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1361066782, now seen corresponding path program 1 times [2018-10-27 06:10:36,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 2 times [2018-10-27 06:10:36,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1490895842, now seen corresponding path program 1 times [2018-10-27 06:10:36,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:37,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:37,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:37,209 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-27 06:10:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:37,265 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-10-27 06:10:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:37,294 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-10-27 06:10:37,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:37,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 120 transitions. [2018-10-27 06:10:37,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:37,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 88 states and 95 transitions. [2018-10-27 06:10:37,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-10-27 06:10:37,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-10-27 06:10:37,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 95 transitions. [2018-10-27 06:10:37,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:37,301 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-27 06:10:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 95 transitions. [2018-10-27 06:10:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-10-27 06:10:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 06:10:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-10-27 06:10:37,304 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-10-27 06:10:37,304 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-10-27 06:10:37,304 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:37,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2018-10-27 06:10:37,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:37,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:37,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:37,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:37,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:37,307 INFO L793 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 544#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 577#L637-1 main_~length~0 := 0; 578#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 570#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 547#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 548#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 536#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 537#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 540#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 575#L630-4 havoc append_#t~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; 558#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 559#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 562#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 572#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 569#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 545#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 546#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 534#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 535#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 538#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 574#L630-4 havoc append_#t~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; 556#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 557#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 561#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 571#L639-4 assume main_~length~0 > 0; 554#L644 assume !(main_~length~0 < 0); 555#L644-2 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644-2 551#L647 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L647 552#L647-1 main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset; 553#L648 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L648 576#L648-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 549#L649 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L649 550#L649-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 542#L652-2 [2018-10-27 06:10:37,307 INFO L795 eck$LassoCheckResult]: Loop: 542#L652-2 assume true; 532#L652 assume !!(main_~length~0 > 0); 533#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 563#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 566#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 529#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 530#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 531#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 560#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 542#L652-2 [2018-10-27 06:10:37,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1522732919, now seen corresponding path program 1 times [2018-10-27 06:10:37,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:37,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:37,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,510 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 06:10:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:37,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:37,868 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_245e5829-977a-4030-9124-6688078dc12e/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-10-27 06:10:37,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:37,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:37,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:10:37,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:37,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:37,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-10-27 06:10:38,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2018-10-27 06:10:38,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-10-27 06:10:38,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-27 06:10:38,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:38,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-10-27 06:10:38,122 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-10-27 06:10:38,127 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-10-27 06:10:38,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-10-27 06:10:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:38,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:10:38,184 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:38,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 3 times [2018-10-27 06:10:38,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:10:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:10:38,312 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-10-27 06:10:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:38,665 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-10-27 06:10:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:10:38,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2018-10-27 06:10:38,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:38,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 67 transitions. [2018-10-27 06:10:38,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-10-27 06:10:38,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:10:38,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 67 transitions. [2018-10-27 06:10:38,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:38,667 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-10-27 06:10:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 67 transitions. [2018-10-27 06:10:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-10-27 06:10:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:10:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-27 06:10:38,671 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-27 06:10:38,671 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-27 06:10:38,671 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:38,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2018-10-27 06:10:38,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:10:38,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:38,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:38,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:38,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:38,673 INFO L793 eck$LassoCheckResult]: Stem: 815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 784#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 819#L637-1 main_~length~0 := 0; 820#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 821#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 825#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 824#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 823#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 822#L630-1 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 812#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 817#L630-4 havoc append_#t~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; 798#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 799#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 802#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 814#L639-3 assume true;assume { :begin_inline_append } true;append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := append_#t~post0 + 1;havoc append_#t~post0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset; 809#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 785#L629-1 SUMMARY for call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L629-1 786#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 776#L630 SUMMARY for call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L630 777#L630-1 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0; 780#L631 SUMMARY for call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset + 0, 4); srcloc: L631 804#L631-1 SUMMARY for call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset + 4, 4); srcloc: L631-1 807#L631-2 append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 811#L630-3 SUMMARY for call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, append_~item~0.offset + 4, 4); srcloc: L630-3 816#L630-4 havoc append_#t~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; 796#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 797#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 801#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 813#L639-4 assume main_~length~0 > 0; 794#L644 assume !(main_~length~0 < 0); 795#L644-2 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644-2 791#L647 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L647 792#L647-1 main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset; 793#L648 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L648 818#L648-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem14.base, main_#t~mem14.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem14.base, main_#t~mem14.offset; 789#L649 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L649 790#L649-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 782#L652-2 [2018-10-27 06:10:38,673 INFO L795 eck$LassoCheckResult]: Loop: 782#L652-2 assume true; 774#L652 assume !!(main_~length~0 > 0); 775#L653 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 803#L653-1 SUMMARY for call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset + 0, 4); srcloc: L653-1 806#L653-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset; 771#L654 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L654 772#L654-1 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem18.base, main_#t~mem18.offset; 773#L655 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L655 800#L655-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 782#L652-2 [2018-10-27 06:10:38,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -453366003, now seen corresponding path program 1 times [2018-10-27 06:10:38,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash -862368161, now seen corresponding path program 4 times [2018-10-27 06:10:38,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:38,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash -803910445, now seen corresponding path program 1 times [2018-10-27 06:10:38,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:38,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,365 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-27 06:10:45,629 WARN L179 SmtUtils]: Spent 6.23 s on a formula simplification. DAG size of input: 392 DAG size of output: 323 [2018-10-27 06:10:47,109 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 164 [2018-10-27 06:10:47,111 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:47,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:47,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:47,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:47,112 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:47,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:47,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:47,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:47,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration5_Lasso [2018-10-27 06:10:47,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:47,112 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:47,678 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 06:10:47,681 INFO L168 Benchmark]: Toolchain (without parser) took 17006.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 275.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:47,682 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-10-27 06:10:47,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.56 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:47,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 935.1 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:47,683 INFO L168 Benchmark]: Boogie Preprocessor took 27.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:47,683 INFO L168 Benchmark]: RCFGBuilder took 654.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:47,684 INFO L168 Benchmark]: BuchiAutomizer took 15864.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.5 MB). Peak memory consumption was 285.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:47,699 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 354.56 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 935.1 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 654.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15864.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.5 MB). Peak memory consumption was 285.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...