./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/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_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/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_c58d4c54-1512-4cba-bdb6-a29a7b983165/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-635dfa2 [2018-12-08 09:12:00,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:12:00,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:12:00,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:12:00,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:12:00,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:12:00,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:12:00,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:12:00,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:12:00,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:12:00,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:12:00,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:12:00,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:12:00,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:12:00,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:12:00,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:12:00,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:12:00,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:12:00,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:12:00,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:12:00,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:12:00,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:12:00,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:12:00,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:12:00,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:12:00,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:12:00,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:12:00,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:12:00,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:12:00,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:12:00,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:12:00,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:12:00,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:12:00,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:12:00,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:12:00,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:12:00,902 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 09:12:00,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:12:00,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:12:00,910 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:12:00,910 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:12:00,910 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:12:00,910 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:12:00,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:12:00,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:12:00,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:12:00,913 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:12:00,913 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:12:00,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:12:00,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:12:00,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:12:00,913 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:12:00,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:12:00,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:12:00,914 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:12:00,914 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:12:00,914 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_c58d4c54-1512-4cba-bdb6-a29a7b983165/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-12-08 09:12:00,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:12:00,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:12:00,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:12:00,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:12:00,941 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:12:00,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-12-08 09:12:00,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/data/19df967aa/36b86a67449b45fcbcd74c441824b2a2/FLAG85248413c [2018-12-08 09:12:01,339 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:12:01,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-12-08 09:12:01,345 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/data/19df967aa/36b86a67449b45fcbcd74c441824b2a2/FLAG85248413c [2018-12-08 09:12:01,713 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/bin-2019/uautomizer/data/19df967aa/36b86a67449b45fcbcd74c441824b2a2 [2018-12-08 09:12:01,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:12:01,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:12:01,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:12:01,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:12:01,718 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:12:01,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:01,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c91a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01, skipping insertion in model container [2018-12-08 09:12:01,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:01,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:12:01,741 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:12:01,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:12:01,884 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:12:01,942 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:12:01,969 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:12:01,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01 WrapperNode [2018-12-08 09:12:01,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:12:01,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:12:01,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:12:01,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:12:01,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:01,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:01,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:12:01,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:12:01,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:12:01,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:12:02,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... [2018-12-08 09:12:02,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:12:02,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:12:02,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:12:02,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:12:02,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/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-12-08 09:12:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:12:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 09:12:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 09:12:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:12:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 09:12:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:12:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:12:02,182 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:12:02,182 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:12:02,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:12:02 BoogieIcfgContainer [2018-12-08 09:12:02,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:12:02,183 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:12:02,183 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:12:02,185 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:12:02,186 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:12:02,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:12:01" (1/3) ... [2018-12-08 09:12:02,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7006a04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:12:02, skipping insertion in model container [2018-12-08 09:12:02,186 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:12:02,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:12:01" (2/3) ... [2018-12-08 09:12:02,187 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7006a04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:12:02, skipping insertion in model container [2018-12-08 09:12:02,187 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:12:02,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:12:02" (3/3) ... [2018-12-08 09:12:02,188 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-12-08 09:12:02,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:12:02,218 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:12:02,218 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:12:02,218 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:12:02,218 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:12:02,219 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:12:02,219 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:12:02,219 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:12:02,219 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:12:02,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 09:12:02,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 09:12:02,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:02,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:02,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:12:02,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:12:02,242 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:12:02,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 09:12:02,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 09:12:02,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:02,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:02,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:12:02,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:12:02,248 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 4#L-1true havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 10#L639-3true [2018-12-08 09:12:02,248 INFO L796 eck$LassoCheckResult]: Loop: 10#L639-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L630true assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 5#L630-2true call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 12#L625true main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 7#L639-1true assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 10#L639-3true [2018-12-08 09:12:02,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 09:12:02,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:02,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:02,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:02,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2018-12-08 09:12:02,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:02,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:02,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:02,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:02,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2018-12-08 09:12:02,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:12:02,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:12:02,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:12:02,803 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2018-12-08 09:12:03,068 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-08 09:12:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:12:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:12:03,080 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-12-08 09:12:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:12:03,114 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-08 09:12:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:12:03,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-12-08 09:12:03,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 09:12:03,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2018-12-08 09:12:03,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 09:12:03,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 09:12:03,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-12-08 09:12:03,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:12:03,120 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-08 09:12:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-12-08 09:12:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-08 09:12:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 09:12:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-08 09:12:03,137 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 09:12:03,137 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 09:12:03,137 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:12:03,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-08 09:12:03,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 09:12:03,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:03,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:03,138 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 09:12:03,138 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:12:03,138 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 46#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 47#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 54#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 44#L630-2 [2018-12-08 09:12:03,138 INFO L796 eck$LassoCheckResult]: Loop: 44#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 45#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 49#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 51#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 53#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 44#L630-2 [2018-12-08 09:12:03,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-12-08 09:12:03,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:03,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2018-12-08 09:12:03,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:03,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:03,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2018-12-08 09:12:03,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:03,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:12:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:03,659 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2018-12-08 09:12:04,245 WARN L180 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-12-08 09:12:04,417 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-08 09:12:04,483 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:12:04,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:12:04,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:12:04,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:12:04,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:12:04,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:12:04,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:12:04,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:12:04,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-08 09:12:04,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:12:04,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:12:04,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:04,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,442 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-12-08 09:12:05,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:05,675 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-08 09:12:05,884 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 09:12:07,638 WARN L180 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-12-08 09:12:07,701 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:12:07,705 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:12:07,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-12-08 09:12:07,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:12:07,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:12:07,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,721 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-12-08 09:12:07,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:12:07,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:12:07,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,725 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-12-08 09:12:07,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,728 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-12-08 09:12:07,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,730 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-12-08 09:12:07,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,732 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-12-08 09:12:07,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,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-12-08 09:12:07,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,736 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-12-08 09:12:07,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,738 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-12-08 09:12:07,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:12:07,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,741 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-12-08 09:12:07,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,743 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-12-08 09:12:07,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,744 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-12-08 09:12:07,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,745 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-12-08 09:12:07,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:12:07,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:12:07,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:12:07,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:12:07,746 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-12-08 09:12:07,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:12:07,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:12:07,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:12:07,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:12:07,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:12:07,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:12:07,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:12:07,766 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 09:12:07,766 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 09:12:07,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:12:07,768 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:12:07,769 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:12:07,769 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2018-12-08 09:12:07,789 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-08 09:12:07,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:07,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:12:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:07,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:12:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:12:07,855 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 09:12:07,856 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-08 09:12:07,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 26 transitions. Complement of second has 6 states. [2018-12-08 09:12:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 09:12:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:12:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-08 09:12:07,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2018-12-08 09:12:07,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:12:07,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2018-12-08 09:12:07,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:12:07,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2018-12-08 09:12:07,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:12:07,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-12-08 09:12:07,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:07,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2018-12-08 09:12:07,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 09:12:07,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 09:12:07,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-12-08 09:12:07,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:12:07,882 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-08 09:12:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-12-08 09:12:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-08 09:12:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 09:12:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-08 09:12:07,883 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 09:12:07,883 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-08 09:12:07,883 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:12:07,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-08 09:12:07,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:07,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:07,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:07,884 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:12:07,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-08 09:12:07,884 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 157#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 158#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 165#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 167#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 154#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 160#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 161#L639-4 assume !(main_~length~0 > 0); 159#L650-1 [2018-12-08 09:12:07,884 INFO L796 eck$LassoCheckResult]: Loop: 159#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 159#L650-1 [2018-12-08 09:12:07,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2018-12-08 09:12:07,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:07,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:07,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:12:07,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:12:07,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:12:07,908 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:12:07,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2018-12-08 09:12:07,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:07,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:12:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:12:07,991 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-08 09:12:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:12:08,001 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-08 09:12:08,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:12:08,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-08 09:12:08,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:08,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-12-08 09:12:08,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 09:12:08,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 09:12:08,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-12-08 09:12:08,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:12:08,003 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-08 09:12:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-12-08 09:12:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-08 09:12:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 09:12:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-08 09:12:08,004 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 09:12:08,004 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 09:12:08,004 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 09:12:08,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-08 09:12:08,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:08,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:08,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:08,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:12:08,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-08 09:12:08,005 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 192#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 193#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 204#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 206#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 195#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 199#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 200#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);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;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 198#L650-1 [2018-12-08 09:12:08,005 INFO L796 eck$LassoCheckResult]: Loop: 198#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 198#L650-1 [2018-12-08 09:12:08,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2018-12-08 09:12:08,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2018-12-08 09:12:08,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2018-12-08 09:12:08,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:12:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:12:08,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:12:08,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:12:08,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:12:08,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:12:08,144 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-08 09:12:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:12:08,154 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-12-08 09:12:08,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:12:08,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2018-12-08 09:12:08,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:08,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2018-12-08 09:12:08,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 09:12:08,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-08 09:12:08,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-12-08 09:12:08,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:12:08,157 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-08 09:12:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-12-08 09:12:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-08 09:12:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 09:12:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-08 09:12:08,158 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-08 09:12:08,158 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-08 09:12:08,158 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 09:12:08,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-12-08 09:12:08,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:08,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:08,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:08,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 09:12:08,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-08 09:12:08,159 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 247#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 248#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 255#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 244#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 245#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 252#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 253#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 256#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 258#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 257#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 250#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 251#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);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;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 249#L650-1 [2018-12-08 09:12:08,160 INFO L796 eck$LassoCheckResult]: Loop: 249#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 249#L650-1 [2018-12-08 09:12:08,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2018-12-08 09:12:08,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:12:08,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:12:08,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58d4c54-1512-4cba-bdb6-a29a7b983165/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-12-08 09:12:08,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:12:08,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:12:08,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-08 09:12:08,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 09:12:08,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:12:08,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-08 09:12:08,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-12-08 09:12:08,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 09:12:08,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-08 09:12:08,324 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:12:08,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:12:08,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:12:08,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:12:08,349 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-12-08 09:12:08,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-08 09:12:08,364 INFO L478 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-12-08 09:12:08,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:12:08,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:12:08,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:12:08,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-08 09:12:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:12:08,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:12:08,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-12-08 09:12:08,384 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:12:08,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2018-12-08 09:12:08,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:12:08,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:12:08,448 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-08 09:12:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:12:08,479 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-08 09:12:08,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:12:08,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-12-08 09:12:08,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:08,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-12-08 09:12:08,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 09:12:08,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 09:12:08,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-12-08 09:12:08,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:12:08,480 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-08 09:12:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-12-08 09:12:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-08 09:12:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 09:12:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-08 09:12:08,481 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-08 09:12:08,481 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-08 09:12:08,481 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 09:12:08,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-12-08 09:12:08,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-08 09:12:08,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:12:08,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:12:08,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:12:08,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-08 09:12:08,482 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 329#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 330#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 337#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 339#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 328#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 334#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 335#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 338#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 325#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 326#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 332#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 333#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);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;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 331#L650-1 [2018-12-08 09:12:08,482 INFO L796 eck$LassoCheckResult]: Loop: 331#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 331#L650-1 [2018-12-08 09:12:08,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2018-12-08 09:12:08,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:12:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2018-12-08 09:12:08,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:12:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:12:08,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2018-12-08 09:12:08,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:12:08,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:12:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:12:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:12:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:12:12,670 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 315 DAG size of output: 249 [2018-12-08 09:12:13,288 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2018-12-08 09:12:13,290 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:12:13,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:12:13,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:12:13,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:12:13,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:12:13,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:12:13,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:12:13,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:12:13,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-08 09:12:13,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:12:13,291 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:12:13,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-12-08 09:12:13,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,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-12-08 09:12:13,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,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-12-08 09:12:13,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,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-12-08 09:12:13,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,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-12-08 09:12:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,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-12-08 09:12:13,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,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-12-08 09:12:13,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-12-08 09:12:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:12:13,641 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 09:12:13,643 INFO L168 Benchmark]: Toolchain (without parser) took 11928.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.3 MB). Free memory was 950.6 MB in the beginning and 895.2 MB in the end (delta: 55.5 MB). Peak memory consumption was 428.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:12:13,644 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:12:13,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:12:13,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:12:13,645 INFO L168 Benchmark]: Boogie Preprocessor took 14.65 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:12:13,645 INFO L168 Benchmark]: RCFGBuilder took 171.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:12:13,646 INFO L168 Benchmark]: BuchiAutomizer took 11459.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 196.4 MB). Peak memory consumption was 436.5 MB. Max. memory is 11.5 GB. [2018-12-08 09:12:13,648 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.65 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11459.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 895.2 MB in the end (delta: 196.4 MB). Peak memory consumption was 436.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...