./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_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_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/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 f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/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:09:50,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:50,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:50,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:50,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:50,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:50,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:50,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:50,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:50,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:50,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:50,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:50,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:50,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:50,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:50,760 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:50,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:50,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:50,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:50,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:50,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:50,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:50,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:50,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:50,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:50,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:50,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:50,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:50,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:50,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:50,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:50,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:50,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:50,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:50,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:50,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:50,781 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:09:50,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:50,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:50,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:50,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:50,796 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:50,796 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:50,796 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:50,796 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:50,797 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:50,797 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:50,797 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:50,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:50,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:09:50,797 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:50,798 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:09:50,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:50,799 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:50,801 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:50,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:50,801 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:50,802 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:50,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:50,802 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:50,802 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:50,803 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:50,803 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_b8c56f49-d156-4a5e-b684-f6939d288932/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 -> f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 [2018-10-27 06:09:50,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:50,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:50,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:50,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:50,851 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:50,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-10-27 06:09:50,908 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/data/0fcf8231c/5bfa203dfa1e4f6e85803d850424c81a/FLAGe4c69af1f [2018-10-27 06:09:51,358 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:51,359 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-10-27 06:09:51,373 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/data/0fcf8231c/5bfa203dfa1e4f6e85803d850424c81a/FLAGe4c69af1f [2018-10-27 06:09:51,384 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/bin-2019/uautomizer/data/0fcf8231c/5bfa203dfa1e4f6e85803d850424c81a [2018-10-27 06:09:51,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:51,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:51,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:51,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:51,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:51,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebf8acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51, skipping insertion in model container [2018-10-27 06:09:51,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:51,448 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:51,703 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:51,711 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:51,752 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:51,794 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:51,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51 WrapperNode [2018-10-27 06:09:51,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:51,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:51,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:51,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:51,804 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:09:51" (1/1) ... [2018-10-27 06:09:51,819 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:09:51" (1/1) ... [2018-10-27 06:09:51,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:51,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:51,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:51,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:51,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... [2018-10-27 06:09:51,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:51,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:51,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:51,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:51,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/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:09:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 06:09:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 06:09:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:52,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:52,644 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:52,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:52 BoogieIcfgContainer [2018-10-27 06:09:52,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:52,645 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:52,646 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:52,650 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:52,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:52,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:51" (1/3) ... [2018-10-27 06:09:52,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7911964e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:52, skipping insertion in model container [2018-10-27 06:09:52,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:52,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:51" (2/3) ... [2018-10-27 06:09:52,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7911964e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:52, skipping insertion in model container [2018-10-27 06:09:52,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:52,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:52" (3/3) ... [2018-10-27 06:09:52,655 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-10-27 06:09:52,713 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:52,714 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:52,714 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:52,714 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:52,715 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:52,715 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:52,715 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:52,715 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:52,715 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:52,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2018-10-27 06:09:52,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-10-27 06:09:52,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:52,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:52,765 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:52,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:52,766 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:52,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2018-10-27 06:09:52,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-10-27 06:09:52,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:52,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:52,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:52,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:52,778 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 10#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; 37#L637true SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 40#L637-1true main_~length~0 := 0; 41#L639-3true [2018-10-27 06:09:52,779 INFO L795 eck$LassoCheckResult]: Loop: 41#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; 30#L629true SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 11#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 13#L629-2true havoc append_#t~mem2.base, append_#t~mem2.offset; 6#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 8#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; 35#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 38#L630-4true havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 21#L633true SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 23#L633-1true assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 33#L639-1true assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 41#L639-3true [2018-10-27 06:09:52,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-10-27 06:09:52,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:52,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:52,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 619840402, now seen corresponding path program 1 times [2018-10-27 06:09:52,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:52,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1394771889, now seen corresponding path program 1 times [2018-10-27 06:09:53,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:53,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:53,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:54,693 WARN L179 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-10-27 06:09:54,993 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:09:55,111 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:09:55,169 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:55,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:55,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:55,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:55,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:55,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:55,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:55,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:55,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-10-27 06:09:55,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:55,172 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:55,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:09:55,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:09:55,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:09:55,216 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:09:55,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:09:55,220 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:09:55,263 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:09:55,268 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:09:55,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:09:55,280 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:09:55,282 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:09:55,286 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:09:55,288 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:09:55,290 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:09:55,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,294 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:09:55,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,303 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:09:55,306 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:09:55,311 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:09:55,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,333 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:09:55,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,339 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:09:55,342 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:09:55,352 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:09:55,355 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:09:55,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:55,527 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-27 06:09:55,884 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-10-27 06:09:55,884 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:09:55,886 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:09:55,887 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:09:55,889 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:09:55,890 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:09:55,892 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:09:56,524 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:56,530 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:56,532 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:09:56,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,556 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:09:56,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,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:09:56,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,564 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:09:56,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,571 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:09:56,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,575 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:09:56,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,577 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:09:56,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,580 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:09:56,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,587 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:09:56,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,594 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:09:56,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,597 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:09:56,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,603 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:09:56,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,629 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:09:56,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,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:09:56,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,650 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:56,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,665 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:56,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,669 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:09:56,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,689 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:09:56,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,703 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:09:56,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,706 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:09:56,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,709 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:09:56,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,720 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:09:56,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,723 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:09:56,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,731 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:09:56,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,734 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:09:56,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,749 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:09:56,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,752 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:09:56,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,770 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:09:56,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:56,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,796 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:09:56,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,797 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:56,797 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:56,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,811 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-10-27 06:09:56,811 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:56,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,893 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:09:56,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:56,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:56,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,967 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:09:56,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:56,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:56,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:56,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:56,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:56,975 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:09:56,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:56,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:56,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:56,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:56,982 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:09:56,983 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:57,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,007 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:09:57,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:57,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:57,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,038 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:09:57,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:57,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:57,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:57,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,044 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:09:57,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:57,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:57,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,060 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:09:57,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:57,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:57,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:57,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,067 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:09:57,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:57,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:57,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:57,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,069 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:09:57,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:57,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:57,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:57,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,078 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:09:57,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:57,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:57,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:57,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,080 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:09:57,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:57,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:57,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:57,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:57,082 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:09:57,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:57,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:57,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:57,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:57,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:57,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:57,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:57,116 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:09:57,116 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:09:57,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:57,120 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:57,120 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:57,121 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 37 Supporting invariants [] [2018-10-27 06:09:57,149 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:09:57,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,383 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:09:57,400 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:09:57,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states. Second operand 3 states. [2018-10-27 06:09:57,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states.. Second operand 3 states. Result 104 states and 116 transitions. Complement of second has 5 states. [2018-10-27 06:09:57,520 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:09:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-10-27 06:09:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-10-27 06:09:57,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 11 letters. [2018-10-27 06:09:57,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 15 letters. Loop has 11 letters. [2018-10-27 06:09:57,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 22 letters. [2018-10-27 06:09:57,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:57,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2018-10-27 06:09:57,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:57,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 52 states and 57 transitions. [2018-10-27 06:09:57,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-10-27 06:09:57,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:09:57,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2018-10-27 06:09:57,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:57,541 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:09:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2018-10-27 06:09:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-27 06:09:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:09:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:09:57,575 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:09:57,575 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:09:57,575 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:57,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:09:57,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:57,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:57,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:57,577 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:09:57,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:57,578 INFO L793 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 235#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; 236#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 268#L637-1 main_~length~0 := 0; 269#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; 261#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 237#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 238#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 224#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 225#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; 229#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 265#L630-4 havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 248#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 249#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 253#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 263#L639-4 assume !(main_~length~0 > 0); 244#L650-2 [2018-10-27 06:09:57,578 INFO L795 eck$LassoCheckResult]: Loop: 244#L650-2 assume true; 233#L650 assume !!(main_~length~0 > 0); 234#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 260#L651-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: L651-1 241#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset; 222#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 223#L652-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#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 255#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 244#L650-2 [2018-10-27 06:09:57,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -288255611, now seen corresponding path program 1 times [2018-10-27 06:09:57,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:57,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,757 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:09:57,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:57,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:57,762 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:57,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 1 times [2018-10-27 06:09:57,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:58,017 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-27 06:09:58,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:09:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:09:58,052 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:09:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:58,080 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-10-27 06:09:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:58,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2018-10-27 06:09:58,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:58,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 82 transitions. [2018-10-27 06:09:58,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:09:58,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:09:58,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 82 transitions. [2018-10-27 06:09:58,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:58,088 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-10-27 06:09:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 82 transitions. [2018-10-27 06:09:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2018-10-27 06:09:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:09:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-27 06:09:58,098 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-27 06:09:58,098 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-27 06:09:58,098 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:58,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 56 transitions. [2018-10-27 06:09:58,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:58,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:58,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:58,104 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, 1, 1] [2018-10-27 06:09:58,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:58,105 INFO L793 eck$LassoCheckResult]: Stem: 400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 370#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; 371#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 403#L637-1 main_~length~0 := 0; 404#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; 396#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 372#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 373#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 359#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 360#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; 364#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 401#L630-4 havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 383#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 384#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 388#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 398#L639-4 assume main_~length~0 > 0; 381#L644 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644 382#L644-1 SUMMARY for call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset + 0, 4); srcloc: L644-1 387#L644-2 main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem11.base, main_#t~mem11.offset; 380#L645 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L645 354#L645-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 4, 4); srcloc: L645-1 355#L645-2 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; 356#L646 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L646 405#L646-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#L647 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L647 378#L647-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 379#L650-2 [2018-10-27 06:09:58,105 INFO L795 eck$LassoCheckResult]: Loop: 379#L650-2 assume true; 368#L650 assume !!(main_~length~0 > 0); 369#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 395#L651-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: L651-1 376#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset; 357#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 358#L652-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; 363#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 390#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 379#L650-2 [2018-10-27 06:09:58,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1166139038, now seen corresponding path program 1 times [2018-10-27 06:09:58,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:58,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:58,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 2 times [2018-10-27 06:09:58,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:58,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:58,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:58,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:58,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2021659484, now seen corresponding path program 1 times [2018-10-27 06:09:58,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:58,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:58,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:58,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:58,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:09:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:09:58,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:09:58,428 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-10-27 06:09:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:58,463 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-10-27 06:09:58,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:09:58,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 124 transitions. [2018-10-27 06:09:58,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:58,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 90 states and 97 transitions. [2018-10-27 06:09:58,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:09:58,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:09:58,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 97 transitions. [2018-10-27 06:09:58,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:58,466 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-10-27 06:09:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 97 transitions. [2018-10-27 06:09:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 52. [2018-10-27 06:09:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:09:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-10-27 06:09:58,472 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-10-27 06:09:58,472 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-10-27 06:09:58,472 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:58,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 55 transitions. [2018-10-27 06:09:58,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:58,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:58,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:58,474 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, 1, 1] [2018-10-27 06:09:58,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:58,474 INFO L793 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 548#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; 549#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 581#L637-1 main_~length~0 := 0; 582#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; 575#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 552#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 553#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 539#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 540#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; 544#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 580#L630-4 havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 563#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 564#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 567#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 577#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; 574#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 550#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 551#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 537#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 538#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; 542#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 579#L630-4 havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 561#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 562#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 566#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 576#L639-4 assume main_~length~0 > 0; 559#L644 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644 560#L644-1 SUMMARY for call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset + 0, 4); srcloc: L644-1 565#L644-2 main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem11.base, main_#t~mem11.offset; 558#L645 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L645 532#L645-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 4, 4); srcloc: L645-1 533#L645-2 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; 534#L646 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L646 583#L646-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; 555#L647 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L647 556#L647-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 557#L650-2 [2018-10-27 06:09:58,475 INFO L795 eck$LassoCheckResult]: Loop: 557#L650-2 assume true; 546#L650 assume !!(main_~length~0 > 0); 547#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 573#L651-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: L651-1 554#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset; 535#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 536#L652-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; 541#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 568#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 557#L650-2 [2018-10-27 06:09:58,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 88532297, now seen corresponding path program 1 times [2018-10-27 06:09:58,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:58,618 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:09:58,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:58,618 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8c56f49-d156-4a5e-b684-f6939d288932/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:09:58,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:58,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:58,803 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:09:58,806 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:09:58,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,817 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:09:58,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-10-27 06:09:59,039 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-10-27 06:09:59,050 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:09:59,059 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:09:59,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,073 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:09:59,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,117 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:09:59,118 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-10-27 06:09:59,131 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:09:59,133 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:09:59,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,137 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:09:59,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-10-27 06:09:59,142 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:09:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:59,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:09:59,171 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:59,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 3 times [2018-10-27 06:09:59,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:59,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:59,319 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-27 06:09:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:09:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:09:59,352 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-10-27 06:09:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:59,816 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-10-27 06:09:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:09:59,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 69 transitions. [2018-10-27 06:09:59,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:59,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 69 transitions. [2018-10-27 06:09:59,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:09:59,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:09:59,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 69 transitions. [2018-10-27 06:09:59,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:59,820 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-10-27 06:09:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 69 transitions. [2018-10-27 06:09:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-10-27 06:09:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 06:09:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-10-27 06:09:59,828 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-27 06:09:59,828 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-27 06:09:59,828 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:59,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 59 transitions. [2018-10-27 06:09:59,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:09:59,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:59,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:59,830 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, 1, 1] [2018-10-27 06:09:59,830 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:59,830 INFO L793 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 799#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; 800#L637 SUMMARY for call write~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L637 837#L637-1 main_~length~0 := 0; 838#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; 839#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 803#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 804#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 791#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 792#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; 831#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 836#L630-4 havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 816#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 817#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 820#L639-1 assume !!(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 833#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; 827#L629 SUMMARY for call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4); srcloc: L629 801#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 802#L629-2 havoc append_#t~mem2.base, append_#t~mem2.offset; 789#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 790#L630-1 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0; 794#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 822#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 824#L631-2 append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 830#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 835#L630-4 havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem4.base, append_#t~mem4.offset; 814#L633 SUMMARY for call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); srcloc: L633 815#L633-1 assume { :end_inline_append } true;main_#t~post9 := main_~length~0;main_~length~0 := main_#t~post9 + 1;havoc main_#t~post9; 819#L639-1 assume !(main_#t~nondet8 != 0 && ~c~0 < 20);havoc main_#t~nondet8; 832#L639-4 assume main_~length~0 > 0; 812#L644 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L644 813#L644-1 SUMMARY for call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset + 0, 4); srcloc: L644-1 818#L644-2 main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem11.base, main_#t~mem11.offset; 811#L645 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L645 784#L645-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 4, 4); srcloc: L645-1 785#L645-2 ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset; 786#L646 SUMMARY for call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L646 840#L646-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; 808#L647 SUMMARY for call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L647 809#L647-1 main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 810#L650-2 [2018-10-27 06:09:59,830 INFO L795 eck$LassoCheckResult]: Loop: 810#L650-2 assume true; 797#L650 assume !!(main_~length~0 > 0); 798#L651 SUMMARY for call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L651 826#L651-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: L651-1 805#L651-2 main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset; 787#L652 SUMMARY for call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L652 788#L652-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; 793#L653 SUMMARY for call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4); srcloc: L653 821#L653-1 main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 810#L650-2 [2018-10-27 06:09:59,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:59,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1252954829, now seen corresponding path program 1 times [2018-10-27 06:09:59,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1682058919, now seen corresponding path program 4 times [2018-10-27 06:09:59,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:59,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:59,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:59,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:59,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 31040525, now seen corresponding path program 1 times [2018-10-27 06:09:59,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:00,579 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-27 06:10:09,786 WARN L179 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 420 DAG size of output: 345 [2018-10-27 06:10:11,555 WARN L179 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 167 [2018-10-27 06:10:11,559 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:11,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:11,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:11,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:11,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:11,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:11,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:11,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:11,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-10-27 06:10:11,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:11,560 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:11,567 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:11,588 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:11,589 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:11,591 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:11,592 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:11,596 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:11,597 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:11,598 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:11,600 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:11,628 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:11,656 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:11,671 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:11,673 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:11,676 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:11,677 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:11,679 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:11,680 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:11,682 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:11,683 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:11,685 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:11,688 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:11,689 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:11,691 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:11,696 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:11,707 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:11,709 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:11,713 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:11,715 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:11,716 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:12,240 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:12,242 INFO L168 Benchmark]: Toolchain (without parser) took 20855.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -238.8 MB). Peak memory consumption was 457.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,243 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:12,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.12 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 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:12,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,245 INFO L168 Benchmark]: Boogie Preprocessor took 42.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,245 INFO L168 Benchmark]: RCFGBuilder took 686.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,246 INFO L168 Benchmark]: BuchiAutomizer took 19596.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.7 MB). Peak memory consumption was 466.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:12,249 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.12 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 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 119.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 686.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19596.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.7 MB). Peak memory consumption was 466.2 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...