./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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.25-f470102 [2019-12-07 14:21:50,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:21:50,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:21:50,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:21:50,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:21:50,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:21:50,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:21:50,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:21:50,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:21:50,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:21:50,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:21:50,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:21:50,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:21:50,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:21:50,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:21:50,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:21:50,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:21:50,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:21:50,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:21:50,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:21:50,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:21:50,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:21:50,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:21:50,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:21:50,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:21:50,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:21:50,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:21:50,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:21:50,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:21:50,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:21:50,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:21:50,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:21:50,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:21:50,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:21:50,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:21:50,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:21:50,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:21:50,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:21:50,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:21:50,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:21:50,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:21:50,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 14:21:50,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:21:50,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:21:50,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:21:50,064 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 14:21:50,064 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 14:21:50,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 14:21:50,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:21:50,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:21:50,066 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 14:21:50,066 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:21:50,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 14:21:50,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:21:50,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:21:50,066 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 14:21:50,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:21:50,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:21:50,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:21:50,067 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 14:21:50,067 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 14:21:50,068 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_63e8b139-84b7-44f7-a395-b5fe8eae1203/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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-12-07 14:21:50,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:21:50,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:21:50,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:21:50,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:21:50,178 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:21:50,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 14:21:50,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/data/b149e6ea6/8962e5d1cfc84171a3824339135b2c4a/FLAG4ef21ca33 [2019-12-07 14:21:50,693 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:21:50,693 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 14:21:50,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/data/b149e6ea6/8962e5d1cfc84171a3824339135b2c4a/FLAG4ef21ca33 [2019-12-07 14:21:50,715 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/data/b149e6ea6/8962e5d1cfc84171a3824339135b2c4a [2019-12-07 14:21:50,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:21:50,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:21:50,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:21:50,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:21:50,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:21:50,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:21:50" (1/1) ... [2019-12-07 14:21:50,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f115626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:50, skipping insertion in model container [2019-12-07 14:21:50,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:21:50" (1/1) ... [2019-12-07 14:21:50,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:21:50,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:21:50,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:21:50,980 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:21:51,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:21:51,046 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:21:51,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51 WrapperNode [2019-12-07 14:21:51,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:21:51,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:21:51,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:21:51,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:21:51,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:21:51,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:21:51,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:21:51,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:21:51,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... [2019-12-07 14:21:51,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:21:51,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:21:51,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:21:51,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:21:51,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 14:21:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:21:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:21:51,331 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:21:51,332 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:21:51,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:21:51 BoogieIcfgContainer [2019-12-07 14:21:51,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:21:51,333 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 14:21:51,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 14:21:51,336 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 14:21:51,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:21:51,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 02:21:50" (1/3) ... [2019-12-07 14:21:51,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d0a51cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:21:51, skipping insertion in model container [2019-12-07 14:21:51,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:21:51,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:51" (2/3) ... [2019-12-07 14:21:51,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d0a51cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:21:51, skipping insertion in model container [2019-12-07 14:21:51,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:21:51,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:21:51" (3/3) ... [2019-12-07 14:21:51,340 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2019-12-07 14:21:51,370 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 14:21:51,370 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 14:21:51,370 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 14:21:51,370 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:21:51,370 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:21:51,370 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 14:21:51,370 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:21:51,371 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 14:21:51,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-12-07 14:21:51,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 14:21:51,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:51,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:51,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 14:21:51,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:21:51,399 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 14:21:51,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-12-07 14:21:51,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 14:21:51,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:51,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:51,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 14:21:51,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:21:51,405 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 8#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; 14#L532-3true [2019-12-07 14:21:51,406 INFO L796 eck$LassoCheckResult]: Loop: 14#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); 5#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; 9#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L518true main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 11#L532-1true assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 14#L532-3true [2019-12-07 14:21:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 14:21:51,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:51,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602780234] [2019-12-07 14:21:51,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:51,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:51,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-12-07 14:21:51,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:51,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877402640] [2019-12-07 14:21:51,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:51,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-12-07 14:21:51,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:51,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250857945] [2019-12-07 14:21:51,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:51,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250857945] [2019-12-07 14:21:51,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:21:51,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:21:51,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139964647] [2019-12-07 14:21:52,142 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-12-07 14:21:52,651 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 14:21:52,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:21:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:21:52,663 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-12-07 14:21:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:52,703 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-12-07 14:21:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:21:52,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-12-07 14:21:52,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 14:21:52,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2019-12-07 14:21:52,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-12-07 14:21:52,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-12-07 14:21:52,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-12-07 14:21:52,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:52,711 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-12-07 14:21:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-12-07 14:21:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-12-07 14:21:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 14:21:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-12-07 14:21:52,729 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-12-07 14:21:52,730 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-12-07 14:21:52,730 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 14:21:52,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-12-07 14:21:52,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 14:21:52,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:52,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:52,731 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 14:21:52,731 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:21:52,731 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 48#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; 49#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); 60#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; 50#L523-2 [2019-12-07 14:21:52,731 INFO L796 eck$LassoCheckResult]: Loop: 50#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 51#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 54#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 56#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); 59#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; 50#L523-2 [2019-12-07 14:21:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-12-07 14:21:52,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:52,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090142920] [2019-12-07 14:21:52,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:52,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-12-07 14:21:52,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:52,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122470459] [2019-12-07 14:21:52,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:52,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-12-07 14:21:52,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:52,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560837951] [2019-12-07 14:21:52,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:52,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:53,402 WARN L192 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-12-07 14:21:54,143 WARN L192 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-07 14:21:54,403 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2019-12-07 14:21:54,507 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:21:54,508 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:21:54,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:21:54,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:21:54,508 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:21:54,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:54,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:21:54,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:21:54,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2019-12-07 14:21:54,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:21:54,509 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:21:54,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:54,897 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-12-07 14:21:55,867 WARN L192 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-12-07 14:21:55,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:55,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:56,231 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-12-07 14:21:57,128 WARN L192 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-12-07 14:22:00,414 WARN L192 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-12-07 14:22:00,499 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:22:00,502 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,506 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-12-07 14:22:00,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:00,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:00,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,521 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-12-07 14:22:00,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,529 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-12-07 14:22:00,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:00,538 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-12-07 14:22:00,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,545 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-12-07 14:22:00,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:00,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:00,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:00,554 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-12-07 14:22:00,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,561 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-12-07 14:22:00,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,569 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-12-07 14:22:00,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,576 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-12-07 14:22:00,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,583 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-12-07 14:22:00,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,590 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-12-07 14:22:00,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:00,597 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-12-07 14:22:00,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,606 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-12-07 14:22:00,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:00,613 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-12-07 14:22:00,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,621 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-12-07 14:22:00,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:00,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:00,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,630 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-12-07 14:22:00,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:00,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,637 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-12-07 14:22:00,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:00,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,638 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-12-07 14:22:00,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,638 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-12-07 14:22:00,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:00,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,644 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-12-07 14:22:00,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:00,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:00,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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-12-07 14:22:00,660 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-12-07 14:22:00,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:00,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:00,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:00,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:00,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:00,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:00,669 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-12-07 14:22:00,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:00,672 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-12-07 14:22:00,672 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2019-12-07 14:22:00,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:01,375 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2019-12-07 14:22:01,375 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-12-07 14:22:03,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,656 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-12-07 14:22:03,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:03,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:03,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,669 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-12-07 14:22:03,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:03,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:03,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:03,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,677 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-12-07 14:22:03,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:03,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:03,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:03,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,684 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-12-07 14:22:03,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:03,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:03,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,695 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-12-07 14:22:03,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:03,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:03,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:03,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,702 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-12-07 14:22:03,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:03,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:03,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,713 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-12-07 14:22:03,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:03,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:03,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,726 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-12-07 14:22:03,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:22:03,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:22:03,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:22:03,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,733 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-12-07 14:22:03,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:22:03,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:22:03,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:22:03,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:22:03,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:22:03,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:22:03,739 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:22:03,748 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-12-07 14:22:03,748 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_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:03,753 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:22:03,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 14:22:03,756 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:22:03,757 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-12-07 14:22:03,789 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-12-07 14:22:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:03,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:22:03,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:22:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:03,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:22:03,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:22:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:03,867 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-12-07 14:22:03,868 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-12-07 14:22:03,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2019-12-07 14:22:03,893 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-12-07 14:22:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 14:22:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-12-07 14:22:03,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2019-12-07 14:22:03,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:22:03,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2019-12-07 14:22:03,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:22:03,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2019-12-07 14:22:03,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:22:03,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-12-07 14:22:03,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:03,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-12-07 14:22:03,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 14:22:03,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-12-07 14:22:03,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-12-07 14:22:03,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:22:03,901 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-12-07 14:22:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-12-07 14:22:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 14:22:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 14:22:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-12-07 14:22:03,903 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-12-07 14:22:03,903 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-12-07 14:22:03,904 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 14:22:03,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-12-07 14:22:03,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:03,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:22:03,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:22:03,905 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:03,905 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 14:22:03,905 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 163#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; 164#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); 177#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; 179#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 166#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 172#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 173#L532-4 assume !(main_~length~0 > 0); 176#L545-1 [2019-12-07 14:22:03,905 INFO L796 eck$LassoCheckResult]: Loop: 176#L545-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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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; 176#L545-1 [2019-12-07 14:22:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2019-12-07 14:22:03,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:03,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183180339] [2019-12-07 14:22:03,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:03,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183180339] [2019-12-07 14:22:03,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:03,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:22:03,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404449229] [2019-12-07 14:22:03,934 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:22:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2019-12-07 14:22:03,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:03,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450569059] [2019-12-07 14:22:03,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:03,942 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:04,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:22:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:22:04,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:22:04,028 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-12-07 14:22:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:04,040 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-12-07 14:22:04,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:22:04,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-12-07 14:22:04,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:04,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2019-12-07 14:22:04,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-12-07 14:22:04,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-12-07 14:22:04,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2019-12-07 14:22:04,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:22:04,043 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-12-07 14:22:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2019-12-07 14:22:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 14:22:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 14:22:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 14:22:04,044 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 14:22:04,044 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 14:22:04,045 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 14:22:04,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-12-07 14:22:04,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:04,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:22:04,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:22:04,046 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:04,046 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 14:22:04,046 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 206#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; 207#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); 220#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; 222#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 211#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 214#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 215#L532-4 assume main_~length~0 > 0; 208#L537 assume !(main_~length~0 < 0); 209#L537-2 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, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.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; 219#L545-1 [2019-12-07 14:22:04,046 INFO L796 eck$LassoCheckResult]: Loop: 219#L545-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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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; 219#L545-1 [2019-12-07 14:22:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2019-12-07 14:22:04,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893416888] [2019-12-07 14:22:04,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,082 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2019-12-07 14:22:04,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220012975] [2019-12-07 14:22:04,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,090 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2019-12-07 14:22:04,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65785007] [2019-12-07 14:22:04,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:04,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65785007] [2019-12-07 14:22:04,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:22:04,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:22:04,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158934283] [2019-12-07 14:22:04,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:22:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:22:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:22:04,198 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-12-07 14:22:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:04,215 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-12-07 14:22:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:22:04,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2019-12-07 14:22:04,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:04,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2019-12-07 14:22:04,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-12-07 14:22:04,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-12-07 14:22:04,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2019-12-07 14:22:04,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:22:04,217 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-12-07 14:22:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2019-12-07 14:22:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-12-07 14:22:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 14:22:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-12-07 14:22:04,219 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-12-07 14:22:04,219 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-12-07 14:22:04,219 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 14:22:04,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-12-07 14:22:04,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:04,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:22:04,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:22:04,220 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:04,220 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 14:22:04,220 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 264#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; 265#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); 277#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; 268#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 269#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 274#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 275#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); 278#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; 280#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 279#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 272#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 273#L532-4 assume main_~length~0 > 0; 266#L537 assume !(main_~length~0 < 0); 267#L537-2 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, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.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; 276#L545-1 [2019-12-07 14:22:04,220 INFO L796 eck$LassoCheckResult]: Loop: 276#L545-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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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; 276#L545-1 [2019-12-07 14:22:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2019-12-07 14:22:04,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920891397] [2019-12-07 14:22:04,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:04,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920891397] [2019-12-07 14:22:04,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641056876] [2019-12-07 14:22:04,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63e8b139-84b7-44f7-a395-b5fe8eae1203/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:22:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:22:04,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 14:22:04,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:22:04,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:22:04,363 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-12-07 14:22:04,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:22:04,433 INFO L614 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-12-07 14:22:04,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:22:04,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-12-07 14:22:04,448 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-12-07 14:22:04,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:22:04,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:22:04,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:22:04,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-12-07 14:22:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:22:04,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:22:04,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-12-07 14:22:04,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812799915] [2019-12-07 14:22:04,451 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:22:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2019-12-07 14:22:04,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234444260] [2019-12-07 14:22:04,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:04,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:22:04,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:22:04,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:22:04,537 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-12-07 14:22:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:22:04,586 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-12-07 14:22:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:22:04,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-12-07 14:22:04,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:04,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 14:22:04,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-12-07 14:22:04,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 14:22:04,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-12-07 14:22:04,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:22:04,587 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 14:22:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-12-07 14:22:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 14:22:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 14:22:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 14:22:04,588 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 14:22:04,589 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 14:22:04,589 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 14:22:04,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-12-07 14:22:04,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 14:22:04,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:22:04,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:22:04,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:22:04,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 14:22:04,590 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 355#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; 356#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); 368#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; 359#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 360#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 365#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 366#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); 369#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; 371#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~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 370#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 363#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 364#L532-4 assume main_~length~0 > 0; 357#L537 assume !(main_~length~0 < 0); 358#L537-2 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, main_#t~mem14.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.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; 367#L545-1 [2019-12-07 14:22:04,590 INFO L796 eck$LassoCheckResult]: Loop: 367#L545-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~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.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; 367#L545-1 [2019-12-07 14:22:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2019-12-07 14:22:04,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027432301] [2019-12-07 14:22:04,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,628 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,629 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2019-12-07 14:22:04,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540967165] [2019-12-07 14:22:04,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:04,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:22:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2019-12-07 14:22:04,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:22:04,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662524397] [2019-12-07 14:22:04,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:22:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:22:04,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:22:09,198 WARN L192 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 316 DAG size of output: 243 [2019-12-07 14:22:09,781 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-12-07 14:22:09,785 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:22:09,785 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:22:09,785 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:22:09,785 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:22:09,785 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:22:09,785 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:22:09,785 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:22:09,785 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:22:09,785 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2019-12-07 14:22:09,785 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:22:09,785 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:22:09,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:09,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:22:10,043 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-12-07 14:22:10,046 INFO L168 Benchmark]: Toolchain (without parser) took 19327.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 935.3 MB in the beginning and 919.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 368.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:22:10,046 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:22:10,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:22:10,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:22:10,047 INFO L168 Benchmark]: Boogie Preprocessor took 19.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:22:10,047 INFO L168 Benchmark]: RCFGBuilder took 236.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:22:10,048 INFO L168 Benchmark]: BuchiAutomizer took 18711.29 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 919.5 MB in the end (delta: 137.6 MB). Peak memory consumption was 388.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:22:10,050 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18711.29 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 919.5 MB in the end (delta: 137.6 MB). Peak memory consumption was 388.3 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...