./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/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 55606309cae57397ff6f26c0cb83fe02a5a029bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/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.24-678e011 [2019-11-20 01:07:54,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:07:54,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:07:54,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:07:54,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:07:54,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:07:54,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:07:54,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:07:54,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:07:54,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:07:54,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:07:54,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:07:54,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:07:54,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:07:54,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:07:54,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:07:54,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:07:54,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:07:54,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:07:54,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:07:54,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:07:54,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:07:54,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:07:54,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:07:54,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:07:54,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:07:54,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:07:54,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:07:54,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:07:54,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:07:54,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:07:54,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:07:54,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:07:54,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:07:54,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:07:54,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:07:54,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:07:54,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:07:54,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:07:54,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:07:54,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:07:54,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 01:07:54,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:07:54,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:07:54,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:07:54,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:07:54,115 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:07:54,115 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 01:07:54,115 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 01:07:54,116 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 01:07:54,116 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 01:07:54,116 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 01:07:54,116 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 01:07:54,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:07:54,117 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:07:54,117 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:07:54,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:07:54,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:07:54,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:07:54,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 01:07:54,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 01:07:54,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 01:07:54,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:07:54,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:07:54,120 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 01:07:54,120 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:07:54,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 01:07:54,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:07:54,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:07:54,121 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 01:07:54,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:07:54,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:07:54,122 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 01:07:54,123 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 01:07:54,123 INFO L138 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/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/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 -> 55606309cae57397ff6f26c0cb83fe02a5a029bc [2019-11-20 01:07:54,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:07:54,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:07:54,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:07:54,319 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:07:54,320 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:07:54,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2019-11-20 01:07:54,383 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/data/3dc3f788b/53cdfebb30f64ef8a32d3c9bea3c35a5/FLAGfb6a3084d [2019-11-20 01:07:54,843 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:07:54,847 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2019-11-20 01:07:54,863 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/data/3dc3f788b/53cdfebb30f64ef8a32d3c9bea3c35a5/FLAGfb6a3084d [2019-11-20 01:07:55,226 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/data/3dc3f788b/53cdfebb30f64ef8a32d3c9bea3c35a5 [2019-11-20 01:07:55,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:07:55,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:07:55,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:07:55,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:07:55,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:07:55,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdd4980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55, skipping insertion in model container [2019-11-20 01:07:55,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,255 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:07:55,297 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:07:55,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:07:55,666 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:07:55,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:07:55,760 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:07:55,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55 WrapperNode [2019-11-20 01:07:55,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:07:55,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:07:55,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:07:55,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:07:55,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:07:55,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:07:55,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:07:55,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:07:55,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... [2019-11-20 01:07:55,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:07:55,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:07:55,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:07:55,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:07:55,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/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 [2019-11-20 01:07:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 01:07:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:07:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:07:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:07:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:07:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 01:07:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:07:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:07:56,280 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:07:56,280 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 01:07:56,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:07:56 BoogieIcfgContainer [2019-11-20 01:07:56,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:07:56,282 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 01:07:56,282 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 01:07:56,286 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 01:07:56,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:07:56,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 01:07:55" (1/3) ... [2019-11-20 01:07:56,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e06fa42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 01:07:56, skipping insertion in model container [2019-11-20 01:07:56,289 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:07:56,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:07:55" (2/3) ... [2019-11-20 01:07:56,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e06fa42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 01:07:56, skipping insertion in model container [2019-11-20 01:07:56,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:07:56,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:07:56" (3/3) ... [2019-11-20 01:07:56,291 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2019-11-20 01:07:56,335 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 01:07:56,335 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 01:07:56,335 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 01:07:56,335 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:07:56,335 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:07:56,335 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 01:07:56,335 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:07:56,335 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 01:07:56,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 01:07:56,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 01:07:56,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:07:56,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:07:56,373 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:07:56,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 01:07:56,374 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 01:07:56,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 01:07:56,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 01:07:56,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:07:56,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:07:56,376 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:07:56,376 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 01:07:56,381 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 4#L-1true havoc main_#res;havoc main_#t~post11, main_#t~nondet10, 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~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, 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.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 11#L532-3true [2019-11-20 01:07:56,382 INFO L796 eck$LassoCheckResult]: Loop: 11#L532-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L523true assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 5#L523-2true call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 12#L518true main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 8#L532-1true assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 11#L532-3true [2019-11-20 01:07:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 01:07:56,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:56,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969375549] [2019-11-20 01:07:56,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:56,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:07:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-11-20 01:07:56,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:56,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627691514] [2019-11-20 01:07:56,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:56,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:07:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-11-20 01:07:56,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:56,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053273201] [2019-11-20 01:07:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:56,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053273201] [2019-11-20 01:07:56,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:07:56,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:07:56,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001050897] [2019-11-20 01:07:57,649 WARN L191 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-11-20 01:07:58,372 WARN L191 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-20 01:07:58,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:07:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:07:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:07:58,398 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-11-20 01:07:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:07:58,468 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-11-20 01:07:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:07:58,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-11-20 01:07:58,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 01:07:58,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2019-11-20 01:07:58,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 01:07:58,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 01:07:58,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-20 01:07:58,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 01:07:58,481 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-20 01:07:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-20 01:07:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-11-20 01:07:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-20 01:07:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-20 01:07:58,508 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-20 01:07:58,508 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-20 01:07:58,509 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 01:07:58,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-20 01:07:58,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 01:07:58,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:07:58,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:07:58,511 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 01:07:58,511 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 01:07:58,512 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 44#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, 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~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, 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.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 45#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 54#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 46#L523-2 [2019-11-20 01:07:58,512 INFO L796 eck$LassoCheckResult]: Loop: 46#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 47#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 49#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 51#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 53#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 46#L523-2 [2019-11-20 01:07:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-11-20 01:07:58,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:58,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880333234] [2019-11-20 01:07:58,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:58,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:07:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-11-20 01:07:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:58,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930235881] [2019-11-20 01:07:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:58,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:07:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:07:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-11-20 01:07:58,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:07:58,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260621728] [2019-11-20 01:07:58,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:07:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:07:58,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:07:59,471 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-11-20 01:08:00,333 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-20 01:08:00,746 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2019-11-20 01:08:00,867 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-20 01:08:00,890 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:08:00,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:08:00,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:08:00,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:08:00,891 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:08:00,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:00,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:08:00,892 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:08:00,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2019-11-20 01:08:00,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:08:00,894 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:08:00,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:00,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:01,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:01,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:01,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:01,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:01,400 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-20 01:08:02,748 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-20 01:08:02,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:02,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:03,016 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 01:08:03,275 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-20 01:08:04,612 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-11-20 01:08:09,121 WARN L191 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-11-20 01:08:09,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:08:09,235 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,240 INFO L120 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 [2019-11-20 01:08:09,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:08:09,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:08:09,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,262 INFO L120 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 [2019-11-20 01:08:09,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,272 INFO L120 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 [2019-11-20 01:08:09,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:08:09,284 INFO L120 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 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,295 INFO L120 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 [2019-11-20 01:08:09,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:08:09,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:08:09,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:08:09,328 INFO L120 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 [2019-11-20 01:08:09,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,344 INFO L120 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 [2019-11-20 01:08:09,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,353 INFO L120 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 [2019-11-20 01:08:09,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,361 INFO L120 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 [2019-11-20 01:08:09,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,381 INFO L120 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 [2019-11-20 01:08:09,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,395 INFO L120 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 [2019-11-20 01:08:09,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:08:09,421 INFO L120 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 [2019-11-20 01:08:09,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,436 INFO L120 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 [2019-11-20 01:08:09,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:08:09,448 INFO L120 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 [2019-11-20 01:08:09,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,462 INFO L120 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 [2019-11-20 01:08:09,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:08:09,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:08:09,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,479 INFO L120 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 [2019-11-20 01:08:09,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,491 INFO L120 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 [2019-11-20 01:08:09,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,493 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-20 01:08:09,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,493 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-20 01:08:09,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,499 INFO L120 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 [2019-11-20 01:08:09,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:08:09,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:08:09,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:08:09,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,510 INFO L120 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 [2019-11-20 01:08:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:08:09,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:08:09,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:08:09,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:08:09,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:08:09,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:08:09,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 01:08:09,561 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-20 01:08:09,561 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:08:09,576 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:09,581 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 01:08:09,582 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 01:08:09,582 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-11-20 01:08:09,648 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-20 01:08:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:09,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:08:09,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:08:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:09,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:08:09,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:08:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:08:09,798 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 [2019-11-20 01:08:09,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-20 01:08:09,841 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. [2019-11-20 01:08:09,842 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 [2019-11-20 01:08:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 01:08:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-20 01:08:09,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-20 01:08:09,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:08:09,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-20 01:08:09,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:08:09,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-20 01:08:09,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:08:09,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-20 01:08:09,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:09,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-11-20 01:08:09,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 01:08:09,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 01:08:09,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-20 01:08:09,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:08:09,849 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-20 01:08:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-20 01:08:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-20 01:08:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 01:08:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-20 01:08:09,851 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 01:08:09,852 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 01:08:09,852 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 01:08:09,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-20 01:08:09,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:09,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:08:09,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:08:09,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:08:09,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 01:08:09,853 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 153#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, 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~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, 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.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 154#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 165#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 167#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 156#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 160#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 161#L532-4 assume !(main_~length~0 > 0); 159#L543-1 [2019-11-20 01:08:09,854 INFO L796 eck$LassoCheckResult]: Loop: 159#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 159#L543-1 [2019-11-20 01:08:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2019-11-20 01:08:09,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:09,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074881393] [2019-11-20 01:08:09,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:08:09,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074881393] [2019-11-20 01:08:09,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:08:09,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:08:09,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759260298] [2019-11-20 01:08:09,922 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 01:08:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:09,922 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2019-11-20 01:08:09,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:09,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179031020] [2019-11-20 01:08:09,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:09,931 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:10,068 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-20 01:08:10,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:08:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:08:10,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:08:10,110 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-20 01:08:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:08:10,132 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-20 01:08:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:08:10,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-20 01:08:10,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:10,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2019-11-20 01:08:10,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 01:08:10,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 01:08:10,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-11-20 01:08:10,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:08:10,135 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-20 01:08:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-11-20 01:08:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-20 01:08:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 01:08:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-20 01:08:10,137 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-20 01:08:10,137 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-20 01:08:10,137 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 01:08:10,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-20 01:08:10,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:10,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:08:10,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:08:10,138 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:08:10,138 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 01:08:10,139 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 192#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, 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~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, 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.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 193#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 204#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 206#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 195#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 200#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 201#L532-4 assume main_~length~0 > 0;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~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 main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);call ULTIMATE.dealloc(main_#t~mem15.base, main_#t~mem15.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 198#L543-1 [2019-11-20 01:08:10,139 INFO L796 eck$LassoCheckResult]: Loop: 198#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 198#L543-1 [2019-11-20 01:08:10,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2019-11-20 01:08:10,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:10,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203015128] [2019-11-20 01:08:10,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:10,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2019-11-20 01:08:10,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:10,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811427027] [2019-11-20 01:08:10,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:10,237 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2019-11-20 01:08:10,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:10,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952238663] [2019-11-20 01:08:10,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:08:10,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952238663] [2019-11-20 01:08:10,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:08:10,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:08:10,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726984981] [2019-11-20 01:08:10,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:08:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:08:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:08:10,457 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-20 01:08:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:08:10,479 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-11-20 01:08:10,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:08:10,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2019-11-20 01:08:10,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:10,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2019-11-20 01:08:10,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 01:08:10,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 01:08:10,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-20 01:08:10,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:08:10,483 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-20 01:08:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-20 01:08:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2019-11-20 01:08:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 01:08:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-20 01:08:10,485 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-20 01:08:10,485 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-20 01:08:10,486 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 01:08:10,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-20 01:08:10,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:10,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:08:10,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:08:10,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 01:08:10,487 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 01:08:10,487 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 244#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, 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~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, 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.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 245#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 255#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 246#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 247#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 252#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 253#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 256#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 258#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 257#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 250#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 251#L532-4 assume main_~length~0 > 0;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~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 main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);call ULTIMATE.dealloc(main_#t~mem15.base, main_#t~mem15.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 249#L543-1 [2019-11-20 01:08:10,488 INFO L796 eck$LassoCheckResult]: Loop: 249#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 249#L543-1 [2019-11-20 01:08:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2019-11-20 01:08:10,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:10,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429351457] [2019-11-20 01:08:10,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:08:10,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429351457] [2019-11-20 01:08:10,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074068299] [2019-11-20 01:08:10,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f94986b-1ee5-4225-9358-b4f015a9884b/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:08:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:10,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 01:08:10,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:08:10,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:08:10,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 31 treesize of output 47 [2019-11-20 01:08:10,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:08:10,798 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-20 01:08:10,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:08:10,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-11-20 01:08:10,825 INFO L377 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 8 [2019-11-20 01:08:10,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:08:10,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:08:10,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:08:10,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-20 01:08:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:08:10,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:08:10,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-20 01:08:10,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864002985] [2019-11-20 01:08:10,831 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 01:08:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2019-11-20 01:08:10,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:10,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803401512] [2019-11-20 01:08:10,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:10,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:10,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:08:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:08:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:08:10,986 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-20 01:08:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:08:11,051 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-20 01:08:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:08:11,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-20 01:08:11,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:11,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-20 01:08:11,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 01:08:11,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 01:08:11,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-20 01:08:11,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:08:11,053 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 01:08:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-20 01:08:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-20 01:08:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 01:08:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-20 01:08:11,055 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 01:08:11,055 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 01:08:11,055 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 01:08:11,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-20 01:08:11,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 01:08:11,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:08:11,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:08:11,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:08:11,056 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 01:08:11,056 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 325#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, 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~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, 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.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 326#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 337#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 339#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 330#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 334#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 335#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.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~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 338#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 327#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 328#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 332#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 333#L532-4 assume main_~length~0 > 0;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~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 main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);call ULTIMATE.dealloc(main_#t~mem15.base, main_#t~mem15.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 331#L543-1 [2019-11-20 01:08:11,057 INFO L796 eck$LassoCheckResult]: Loop: 331#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 331#L543-1 [2019-11-20 01:08:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2019-11-20 01:08:11,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:11,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182054550] [2019-11-20 01:08:11,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:11,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2019-11-20 01:08:11,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:11,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066482181] [2019-11-20 01:08:11,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:11,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:08:11,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2019-11-20 01:08:11,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:08:11,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649711763] [2019-11-20 01:08:11,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:08:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:08:11,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:08:15,769 WARN L191 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 321 DAG size of output: 244 [2019-11-20 01:08:16,364 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-20 01:08:16,367 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:08:16,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:08:16,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:08:16,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:08:16,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:08:16,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:08:16,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:08:16,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:08:16,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration6_Lasso [2019-11-20 01:08:16,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:08:16,368 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:08:16,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:08:16,696 FATAL L? ?]: 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) 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:957) 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:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) 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) [2019-11-20 01:08:16,698 INFO L168 Benchmark]: Toolchain (without parser) took 21459.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.3 MB). Free memory was 939.3 MB in the beginning and 933.7 MB in the end (delta: 5.6 MB). Peak memory consumption was 454.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:16,698 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:08:16,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:16,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.92 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. [2019-11-20 01:08:16,700 INFO L168 Benchmark]: Boogie Preprocessor took 28.24 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:16,702 INFO L168 Benchmark]: RCFGBuilder took 447.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:16,703 INFO L168 Benchmark]: BuchiAutomizer took 20414.81 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.4 MB). Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 140.0 MB). Peak memory consumption was 461.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:08:16,705 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.92 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 28.24 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20414.81 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.4 MB). Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 140.0 MB). Peak memory consumption was 461.4 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...