./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/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/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:03,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:03,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:03,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:03,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:03,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:03,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:03,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:03,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:03,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:03,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:03,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:03,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:03,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:03,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:03,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:03,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:03,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:03,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:03,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:03,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:03,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:03,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:03,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:03,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:03,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:03,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:03,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:03,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:03,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:03,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:03,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:03,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:03,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:03,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:03,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:03,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:03,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:03,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:03,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:03,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:03,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:03,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:03,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:03,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:03,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:03,121 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:03,121 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:03,122 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:03,122 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:03,122 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:03,122 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:03,122 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:03,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:03,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:03,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:03,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:03,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:03,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:03,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:03,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:03,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:03,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:03,125 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:03,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:03,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:03,126 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:03,128 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:03,130 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/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/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-10-22 08:55:03,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:03,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:03,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:03,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:03,183 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:03,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-10-22 08:55:03,232 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/data/b67fdfe76/b95decd2a31042e6a7cb3eacba593c29/FLAG5df364f43 [2019-10-22 08:55:03,725 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:03,725 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-10-22 08:55:03,738 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/data/b67fdfe76/b95decd2a31042e6a7cb3eacba593c29/FLAG5df364f43 [2019-10-22 08:55:04,203 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/data/b67fdfe76/b95decd2a31042e6a7cb3eacba593c29 [2019-10-22 08:55:04,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:04,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:04,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:04,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:04,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:04,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d18724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04, skipping insertion in model container [2019-10-22 08:55:04,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,224 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:04,262 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:04,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:04,634 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:04,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:04,718 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:04,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04 WrapperNode [2019-10-22 08:55:04,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:04,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:04,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:04,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:04,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:04,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:04,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:04,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:04,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:04,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:04,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:04,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:04,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/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-10-22 08:55:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:55:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:55:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:55:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:55:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:04,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:05,192 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:05,192 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:05,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:05 BoogieIcfgContainer [2019-10-22 08:55:05,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:05,195 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:05,195 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:05,199 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:05,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:05,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:04" (1/3) ... [2019-10-22 08:55:05,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77152534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:05, skipping insertion in model container [2019-10-22 08:55:05,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:05,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (2/3) ... [2019-10-22 08:55:05,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77152534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:05, skipping insertion in model container [2019-10-22 08:55:05,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:05,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:05" (3/3) ... [2019-10-22 08:55:05,204 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2019-10-22 08:55:05,253 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:05,253 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:05,253 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:05,253 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:05,253 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:05,253 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:05,254 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:05,254 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:05,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:55:05,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:55:05,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:05,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:05,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:05,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:05,294 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:05,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:55:05,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:55:05,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:05,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:05,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:05,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:05,304 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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-10-22 08:55:05,305 INFO L793 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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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-10-22 08:55:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:55:05,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078490112] [2019-10-22 08:55:05,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,441 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-10-22 08:55:05,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336940485] [2019-10-22 08:55:05,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-10-22 08:55:05,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863215715] [2019-10-22 08:55:05,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:05,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863215715] [2019-10-22 08:55:05,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:05,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:05,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000539493] [2019-10-22 08:55:06,510 WARN L191 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-10-22 08:55:07,346 WARN L191 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-22 08:55:07,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:07,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:07,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:07,365 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-10-22 08:55:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:07,449 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-10-22 08:55:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:07,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-10-22 08:55:07,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:55:07,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2019-10-22 08:55:07,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:55:07,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:55:07,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 08:55:07,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:07,462 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:55:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 08:55:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-10-22 08:55:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:55:07,496 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:07,497 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:07,497 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:07,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:55:07,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:55:07,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:07,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:07,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:07,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:07,499 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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-10-22 08:55:07,499 INFO L793 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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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-10-22 08:55:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-10-22 08:55:07,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181612879] [2019-10-22 08:55:07,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-10-22 08:55:07,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766986761] [2019-10-22 08:55:07,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,645 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-10-22 08:55:07,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512620974] [2019-10-22 08:55:07,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:08,427 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-10-22 08:55:09,351 WARN L191 SmtUtils]: Spent 920.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-10-22 08:55:09,712 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2019-10-22 08:55:09,863 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-22 08:55:09,880 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:09,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:09,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:09,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:09,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:09,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:09,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:09,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:09,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2019-10-22 08:55:09,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:09,883 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:09,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:09,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,366 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-22 08:55:11,502 WARN L191 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-10-22 08:55:11,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,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-10-22 08:55:11,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-10-22 08:55:11,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-10-22 08:55:11,722 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-22 08:55:11,937 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-10-22 08:55:13,316 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-10-22 08:55:16,760 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-10-22 08:55:16,848 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:16,852 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:16,853 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-10-22 08:55:16,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,868 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-10-22 08:55:16,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,870 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-10-22 08:55:16,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,871 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,872 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-10-22 08:55:16,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,874 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-10-22 08:55:16,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,876 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,877 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,879 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-10-22 08:55:16,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,880 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,881 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-10-22 08:55:16,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,894 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-10-22 08:55:16,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,896 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-10-22 08:55:16,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,898 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,900 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-10-22 08:55:16,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,902 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-10-22 08:55:16,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,904 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,904 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-10-22 08:55:16,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,913 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-10-22 08:55:16,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,916 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-10-22 08:55:16,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,917 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,918 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-10-22 08:55:16,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,921 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,921 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,923 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-10-22 08:55:16,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,925 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-10-22 08:55:16,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,926 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:16,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,928 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:16,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,930 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-10-22 08:55:16,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,932 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,932 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,939 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-10-22 08:55:16,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,952 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-10-22 08:55:16,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,953 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-10-22 08:55:16,953 INFO L203 nArgumentSynthesizer]: 8 loop disjuncts [2019-10-22 08:55:16,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:17,487 INFO L400 nArgumentSynthesizer]: We have 224 Motzkin's Theorem applications. [2019-10-22 08:55:17,487 INFO L401 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-10-22 08:55:34,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,454 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-10-22 08:55:34,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,457 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:34,457 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:34,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,460 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-10-22 08:55:34,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:34,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,461 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:34,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:34,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:34,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:34,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:34,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:34,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,465 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-10-22 08:55:34,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,467 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:34,467 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:34,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,471 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-10-22 08:55:34,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:34,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:34,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:34,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,473 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-10-22 08:55:34,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,475 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:34,479 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:34,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,481 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-10-22 08:55:34,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:34,489 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:34,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,492 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-10-22 08:55:34,492 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:34,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,493 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:34,493 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:34,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:34,494 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-10-22 08:55:34,497 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:34,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:34,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:34,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:34,499 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:34,499 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:34,502 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:34,510 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:34,514 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:34,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:34,517 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:34,517 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:34,518 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-10-22 08:55:34,550 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:55:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:34,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:34,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:34,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:34,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:34,655 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-10-22 08:55:34,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-10-22 08:55:34,688 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-10-22 08:55:34,690 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-10-22 08:55:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:55:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:55:34,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2019-10-22 08:55:34,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:34,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2019-10-22 08:55:34,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:34,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2019-10-22 08:55:34,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:34,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-10-22 08:55:34,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:34,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-10-22 08:55:34,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:55:34,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:34,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-10-22 08:55:34,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:34,701 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-10-22 08:55:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-10-22 08:55:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:55:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:55:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 08:55:34,705 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:55:34,705 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:55:34,705 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:34,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-10-22 08:55:34,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:34,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:34,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:34,706 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:34,706 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:34,706 INFO L791 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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-10-22 08:55:34,707 INFO L793 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-10-22 08:55:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2019-10-22 08:55:34,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:34,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746480072] [2019-10-22 08:55:34,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:34,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746480072] [2019-10-22 08:55:34,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:34,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:34,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034369773] [2019-10-22 08:55:34,741 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2019-10-22 08:55:34,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:34,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327097208] [2019-10-22 08:55:34,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:34,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:34,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:34,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:34,850 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:55:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:34,869 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-10-22 08:55:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:34,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-10-22 08:55:34,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:34,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2019-10-22 08:55:34,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:55:34,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:34,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2019-10-22 08:55:34,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:34,871 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 08:55:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2019-10-22 08:55:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-10-22 08:55:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:55:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-22 08:55:34,873 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:55:34,873 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:55:34,873 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:34,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-10-22 08:55:34,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:34,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:34,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:34,874 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:34,874 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:34,874 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 219#L545-1 [2019-10-22 08:55:34,876 INFO L793 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-10-22 08:55:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2019-10-22 08:55:34,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:34,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103913917] [2019-10-22 08:55:34,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:34,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2019-10-22 08:55:34,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:34,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879443000] [2019-10-22 08:55:34,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:34,926 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2019-10-22 08:55:34,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:34,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489541241] [2019-10-22 08:55:34,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:34,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:34,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489541241] [2019-10-22 08:55:34,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:34,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:34,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916423087] [2019-10-22 08:55:35,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:35,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:35,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:35,036 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-10-22 08:55:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:35,056 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-10-22 08:55:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:35,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2019-10-22 08:55:35,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:35,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2019-10-22 08:55:35,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:55:35,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:55:35,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2019-10-22 08:55:35,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:35,058 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 08:55:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2019-10-22 08:55:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-10-22 08:55:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:55:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:55:35,060 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:55:35,060 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:55:35,060 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:35,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:55:35,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:35,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:35,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:35,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:35,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:35,062 INFO L791 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 276#L545-1 [2019-10-22 08:55:35,062 INFO L793 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-10-22 08:55:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2019-10-22 08:55:35,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721865090] [2019-10-22 08:55:35,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:35,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721865090] [2019-10-22 08:55:35,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139222033] [2019-10-22 08:55:35,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38bd65f1-bc1d-43a9-92fa-21e3bacdacd0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:35,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-22 08:55:35,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:35,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:35,222 INFO L375 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-10-22 08:55:35,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:35,247 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-10-22 08:55:35,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:35,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-10-22 08:55:35,268 INFO L375 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-10-22 08:55:35,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:35,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:35,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:35,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-22 08:55:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:35,272 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:35,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-10-22 08:55:35,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865131600] [2019-10-22 08:55:35,272 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,273 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2019-10-22 08:55:35,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081615042] [2019-10-22 08:55:35,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,283 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:35,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:55:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:35,375 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-10-22 08:55:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:35,440 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-10-22 08:55:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:35,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-10-22 08:55:35,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:35,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 08:55:35,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:55:35,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:55:35,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-10-22 08:55:35,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:35,442 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:55:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-10-22 08:55:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:55:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:55:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 08:55:35,444 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:55:35,444 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:55:35,444 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:35,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-10-22 08:55:35,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:35,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:35,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:35,445 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:35,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:35,445 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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~ite9.base, append_#t~ite9.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem6.base, append_#t~mem6.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~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 367#L545-1 [2019-10-22 08:55:35,445 INFO L793 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-10-22 08:55:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2019-10-22 08:55:35,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425783596] [2019-10-22 08:55:35,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2019-10-22 08:55:35,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307350972] [2019-10-22 08:55:35,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2019-10-22 08:55:35,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928563966] [2019-10-22 08:55:35,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:35,593 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:39,778 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 315 DAG size of output: 244 [2019-10-22 08:55:40,384 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-10-22 08:55:40,387 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:40,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:40,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:40,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:40,387 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:40,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:40,387 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:40,387 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:40,387 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2019-10-22 08:55:40,387 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:40,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:40,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:40,654 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) 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-10-22 08:55:40,657 INFO L168 Benchmark]: Toolchain (without parser) took 36449.80 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 944.5 MB in the beginning and 1.6 GB in the end (delta: -664.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-10-22 08:55:40,658 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:40,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:40,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:40,659 INFO L168 Benchmark]: Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:40,659 INFO L168 Benchmark]: RCFGBuilder took 390.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:40,660 INFO L168 Benchmark]: BuchiAutomizer took 35461.62 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -501.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-10-22 08:55:40,666 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 510.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 390.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35461.62 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -501.0 MB). Peak memory consumption was 1.1 GB. 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...