./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 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 19:09:34,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:09:34,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:09:35,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:09:35,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:09:35,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:09:35,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:09:35,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:09:35,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:09:35,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:09:35,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:09:35,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:09:35,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:09:35,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:09:35,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:09:35,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:09:35,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:09:35,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:09:35,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:09:35,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:09:35,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:09:35,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:09:35,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:09:35,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:09:35,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:09:35,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:09:35,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:09:35,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:09:35,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:09:35,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:09:35,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:09:35,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:09:35,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:09:35,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:09:35,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:09:35,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:09:35,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:09:35,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:09:35,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:09:35,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:09:35,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:09:35,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:09:35,142 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:09:35,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:09:35,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:09:35,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:09:35,144 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:09:35,145 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:09:35,145 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:09:35,145 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:09:35,145 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:09:35,146 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:09:35,146 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:09:35,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:09:35,147 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:09:35,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:09:35,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:09:35,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:09:35,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:09:35,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:09:35,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:09:35,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:09:35,149 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:09:35,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:09:35,149 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:09:35,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:09:35,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:09:35,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:09:35,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:09:35,151 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:09:35,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:09:35,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:09:35,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:09:35,152 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:09:35,153 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:09:35,153 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2020-10-19 19:09:35,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:09:35,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:09:35,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:09:35,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:09:35,481 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:09:35,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-10-19 19:09:35,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182314219/668d0bcec96441c1b6116b758fd8055b/FLAGfb2fd4b84 [2020-10-19 19:09:36,013 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:09:36,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2020-10-19 19:09:36,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182314219/668d0bcec96441c1b6116b758fd8055b/FLAGfb2fd4b84 [2020-10-19 19:09:36,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/182314219/668d0bcec96441c1b6116b758fd8055b [2020-10-19 19:09:36,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:09:36,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:09:36,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:36,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:09:36,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:09:36,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:36" (1/1) ... [2020-10-19 19:09:36,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779229fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:36, skipping insertion in model container [2020-10-19 19:09:36,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:36" (1/1) ... [2020-10-19 19:09:36,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:09:36,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:09:36,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:36,981 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:09:37,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:37,087 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:09:37,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37 WrapperNode [2020-10-19 19:09:37,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:37,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:37,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:09:37,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:09:37,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:37,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:09:37,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:09:37,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:09:37,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:09:37,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:09:37,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:09:37,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:09:37,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-19 19:09:37,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 19:09:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 19:09:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:09:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 19:09:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 19:09:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-19 19:09:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:09:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:09:37,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:09:37,702 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:09:37,703 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-19 19:09:37,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:37 BoogieIcfgContainer [2020-10-19 19:09:37,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:09:37,706 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:09:37,706 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:09:37,710 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:09:37,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:37,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:09:36" (1/3) ... [2020-10-19 19:09:37,712 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ea37279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:37, skipping insertion in model container [2020-10-19 19:09:37,713 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:37,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37" (2/3) ... [2020-10-19 19:09:37,713 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ea37279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:37, skipping insertion in model container [2020-10-19 19:09:37,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:37,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:37" (3/3) ... [2020-10-19 19:09:37,716 INFO L373 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2020-10-19 19:09:37,765 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:09:37,765 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:09:37,765 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:09:37,766 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:09:37,766 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:09:37,766 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:09:37,766 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:09:37,767 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:09:37,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-19 19:09:37,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 19:09:37,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:37,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:37,808 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:37,808 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:37,808 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:09:37,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-19 19:09:37,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 19:09:37,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:37,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:37,811 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:37,812 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:37,820 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 13#L543-3true [2020-10-19 19:09:37,821 INFO L796 eck$LassoCheckResult]: Loop: 13#L543-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 5#L534true assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 9#L534-2true call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L529true main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 10#L543-1true assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 13#L543-3true [2020-10-19 19:09:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 19:09:37,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:37,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71172679] [2020-10-19 19:09:37,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:37,954 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:37,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:37,994 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2020-10-19 19:09:37,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:37,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697406167] [2020-10-19 19:09:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:38,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:38,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:38,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:38,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2020-10-19 19:09:38,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:38,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217879116] [2020-10-19 19:09:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:38,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217879116] [2020-10-19 19:09:38,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:38,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 19:09:38,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285070930] [2020-10-19 19:09:39,623 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2020-10-19 19:09:39,725 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:39,742 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:40,590 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-19 19:09:40,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,614 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:40,642 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,512 WARN L193 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-19 19:09:41,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,519 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-19 19:09:41,520 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:739, output treesize:723 [2020-10-19 19:09:42,205 WARN L193 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-19 19:09:42,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:09:42,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:09:42,224 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2020-10-19 19:09:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:42,311 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-10-19 19:09:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:09:42,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-10-19 19:09:42,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 19:09:42,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2020-10-19 19:09:42,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 19:09:42,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 19:09:42,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-10-19 19:09:42,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:42,327 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 19:09:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-10-19 19:09:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-10-19 19:09:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 19:09:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-10-19 19:09:42,352 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-19 19:09:42,352 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-10-19 19:09:42,352 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:09:42,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-10-19 19:09:42,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 19:09:42,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:42,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:42,354 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:09:42,355 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:42,355 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 52#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 53#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 60#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 48#L534-2 [2020-10-19 19:09:42,355 INFO L796 eck$LassoCheckResult]: Loop: 48#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 49#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 54#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 56#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 59#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 48#L534-2 [2020-10-19 19:09:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2020-10-19 19:09:42,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:42,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079545305] [2020-10-19 19:09:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,409 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2020-10-19 19:09:42,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:42,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278174795] [2020-10-19 19:09:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,449 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2020-10-19 19:09:42,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:42,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359665857] [2020-10-19 19:09:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:42,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:42,585 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:43,682 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 170 DAG size of output: 164 [2020-10-19 19:09:43,728 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:43,740 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:44,905 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 165 [2020-10-19 19:09:44,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:44,930 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:44,941 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:46,282 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-19 19:09:46,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:46,288 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-19 19:09:46,289 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:861, output treesize:905 [2020-10-19 19:09:47,555 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 166 [2020-10-19 19:09:48,257 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 142 [2020-10-19 19:09:48,519 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-19 19:09:48,532 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:09:48,534 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:09:48,534 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:09:48,534 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:09:48,534 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:09:48,535 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:48,535 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:09:48,543 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:09:48,543 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2020-10-19 19:09:48,544 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:09:48,544 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:09:48,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:48,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:49,526 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2020-10-19 19:09:51,296 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 139 DAG size of output: 122 [2020-10-19 19:09:51,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:51,693 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-19 19:09:52,039 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-19 19:09:53,711 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2020-10-19 19:09:58,905 WARN L193 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2020-10-19 19:09:59,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:09:59,012 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:59,028 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 [2020-10-19 19:09:59,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,071 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 [2020-10-19 19:09:59,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:59,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:59,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,134 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 [2020-10-19 19:09:59,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,163 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 [2020-10-19 19:09:59,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:59,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:59,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,204 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 [2020-10-19 19:09:59,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,251 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 [2020-10-19 19:09:59,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,281 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 [2020-10-19 19:09:59,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,308 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 [2020-10-19 19:09:59,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,341 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 [2020-10-19 19:09:59,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:59,372 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 [2020-10-19 19:09:59,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,402 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 [2020-10-19 19:09:59,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,432 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 [2020-10-19 19:09:59,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,458 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 [2020-10-19 19:09:59,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:59,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:59,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:59,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,519 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 [2020-10-19 19:09:59,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,548 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 [2020-10-19 19:09:59,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:59,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:59,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:59,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,580 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 [2020-10-19 19:09:59,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:59,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:59,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:59,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:59,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:59,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:59,593 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:09:59,622 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-19 19:09:59,622 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:59,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:59,700 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:09:59,701 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:09:59,702 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2020-10-19 19:09:59,888 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-19 19:09:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:59,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:09:59,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:59,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:09:59,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:10:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:00,027 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 [2020-10-19 19:10:00,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-19 19:10:00,072 INFO L75 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. [2020-10-19 19:10:00,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 19:10:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 19:10:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-19 19:10:00,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2020-10-19 19:10:00,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:10:00,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-19 19:10:00,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:10:00,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2020-10-19 19:10:00,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:10:00,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2020-10-19 19:10:00,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:00,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2020-10-19 19:10:00,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 19:10:00,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 19:10:00,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2020-10-19 19:10:00,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:00,083 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-19 19:10:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2020-10-19 19:10:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-19 19:10:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 19:10:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-19 19:10:00,086 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 19:10:00,086 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 19:10:00,086 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:10:00,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-19 19:10:00,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:00,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:00,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:00,087 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:00,088 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:00,088 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 193#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 194#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 201#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 203#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 188#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 195#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 196#L543-4 assume !(main_~length~0 > 0); 200#L556-1 [2020-10-19 19:10:00,088 INFO L796 eck$LassoCheckResult]: Loop: 200#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 200#L556-1 [2020-10-19 19:10:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2020-10-19 19:10:00,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:00,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446880361] [2020-10-19 19:10:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:00,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446880361] [2020-10-19 19:10:00,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:10:00,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 19:10:00,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648278] [2020-10-19 19:10:00,128 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:10:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2020-10-19 19:10:00,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:00,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149117309] [2020-10-19 19:10:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:00,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:00,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:00,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:00,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 19:10:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 19:10:00,272 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 19:10:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:00,298 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-10-19 19:10:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:10:00,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-10-19 19:10:00,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:00,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2020-10-19 19:10:00,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 19:10:00,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 19:10:00,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2020-10-19 19:10:00,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:00,301 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-19 19:10:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2020-10-19 19:10:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-10-19 19:10:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 19:10:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-10-19 19:10:00,304 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-19 19:10:00,304 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-19 19:10:00,304 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:10:00,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-10-19 19:10:00,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:00,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:00,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:00,305 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:00,306 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:00,306 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 234#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 235#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 244#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 246#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 231#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 238#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 239#L543-4 assume main_~length~0 > 0; 236#L548 assume !(main_~length~0 < 0); 237#L548-2 call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 243#L556-1 [2020-10-19 19:10:00,306 INFO L796 eck$LassoCheckResult]: Loop: 243#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 243#L556-1 [2020-10-19 19:10:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2020-10-19 19:10:00,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:00,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25339587] [2020-10-19 19:10:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:00,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:00,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:00,398 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2020-10-19 19:10:00,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:00,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69323664] [2020-10-19 19:10:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:00,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:00,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:00,428 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:00,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2020-10-19 19:10:00,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:00,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729473329] [2020-10-19 19:10:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:00,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729473329] [2020-10-19 19:10:00,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:10:00,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 19:10:00,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285096180] [2020-10-19 19:10:00,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:10:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:10:00,631 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-19 19:10:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:00,677 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-10-19 19:10:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:10:00,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2020-10-19 19:10:00,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:00,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2020-10-19 19:10:00,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 19:10:00,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 19:10:00,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2020-10-19 19:10:00,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:00,685 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 19:10:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2020-10-19 19:10:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-10-19 19:10:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 19:10:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-10-19 19:10:00,691 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-19 19:10:00,691 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-19 19:10:00,691 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:10:00,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-10-19 19:10:00,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:00,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:00,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:00,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:00,696 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:00,697 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 288#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 289#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 301#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 290#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 291#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 297#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 298#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 302#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 304#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 303#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 295#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 296#L543-4 assume main_~length~0 > 0; 293#L548 assume !(main_~length~0 < 0); 294#L548-2 call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 300#L556-1 [2020-10-19 19:10:00,697 INFO L796 eck$LassoCheckResult]: Loop: 300#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 300#L556-1 [2020-10-19 19:10:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2020-10-19 19:10:00,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:00,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957566771] [2020-10-19 19:10:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:00,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957566771] [2020-10-19 19:10:00,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976470092] [2020-10-19 19:10:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:10:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:10:00,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 19:10:00,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:10:00,870 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-19 19:10:00,871 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:00,877 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-19 19:10:00,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,904 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-19 19:10:00,905 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:00,918 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,918 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2020-10-19 19:10:00,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2020-10-19 19:10:00,967 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,983 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:00,987 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:00,988 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:28 [2020-10-19 19:10:01,069 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 19:10:01,072 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2020-10-19 19:10:01,073 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,088 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2020-10-19 19:10:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:01,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:10:01,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-10-19 19:10:01,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207625487] [2020-10-19 19:10:01,091 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:10:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2020-10-19 19:10:01,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:01,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468530958] [2020-10-19 19:10:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,098 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:01,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 19:10:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-19 19:10:01,244 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-10-19 19:10:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:01,386 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-10-19 19:10:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 19:10:01,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2020-10-19 19:10:01,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:01,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2020-10-19 19:10:01,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-19 19:10:01,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 19:10:01,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2020-10-19 19:10:01,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:10:01,390 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 19:10:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2020-10-19 19:10:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-19 19:10:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 19:10:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-10-19 19:10:01,392 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 19:10:01,392 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 19:10:01,392 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:10:01,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-10-19 19:10:01,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-10-19 19:10:01,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:10:01,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:10:01,394 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:10:01,394 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:10:01,394 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(16);~c~0 := 0; 381#L-1 havoc main_#res;havoc main_#t~post14, main_#t~nondet13, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~post20, main_~next~0.base, main_~next~0.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~post24, 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; 382#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 395#L534 assume !(append_#t~mem8.base != 0 || append_#t~mem8.offset != 0);call append_#t~malloc11.base, append_#t~malloc11.offset := #Ultimate.allocOnHeap(8);append_#t~ite12.base, append_#t~ite12.offset := append_#t~malloc11.base, append_#t~malloc11.offset; 397#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 386#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 391#L543-1 assume !!(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 392#L543-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post5, append_#t~malloc6.base, append_#t~malloc6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~mem8.base, append_#t~mem8.offset, append_#t~ite12.base, append_#t~ite12.offset, append_#t~mem9.base, append_#t~mem9.offset, append_#t~mem10.base, append_#t~mem10.offset, append_#t~malloc11.base, append_#t~malloc11.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~post5 := ~c~0;~c~0 := 1 + append_#t~post5;havoc append_#t~post5;call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc6.base, append_#t~malloc6.offset;call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem7.base, append_#t~mem7.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;call append_#t~mem8.base, append_#t~mem8.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 396#L534 assume append_#t~mem8.base != 0 || append_#t~mem8.offset != 0;call append_#t~mem9.base, append_#t~mem9.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem10.base, append_#t~mem10.offset := read~$Pointer$(append_#t~mem9.base, 4 + append_#t~mem9.offset, 4);append_#t~ite12.base, append_#t~ite12.offset := append_#t~mem10.base, append_#t~mem10.offset; 383#L534-2 call write~$Pointer$(append_#t~ite12.base, append_#t~ite12.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem10.base, append_#t~mem10.offset;havoc append_#t~mem8.base, append_#t~mem8.offset;havoc append_#t~ite12.base, append_#t~ite12.offset;havoc append_#t~mem9.base, append_#t~mem9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 384#L529 main_#t~post14 := main_~length~0;main_~length~0 := 1 + main_#t~post14;havoc main_#t~post14; 389#L543-1 assume !(0 != main_#t~nondet13 && ~c~0 < 20);havoc main_#t~nondet13; 390#L543-4 assume main_~length~0 > 0; 387#L548 assume !(main_~length~0 < 0); 388#L548-2 call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem19.base, main_#t~mem19.offset);havoc main_#t~mem19.base, main_#t~mem19.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post20 := main_~length~0;main_~length~0 := main_#t~post20 - 1;havoc main_#t~post20; 394#L556-1 [2020-10-19 19:10:01,395 INFO L796 eck$LassoCheckResult]: Loop: 394#L556-1 assume !!(main_~length~0 > 0);call main_#t~mem21.base, main_#t~mem21.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_#t~mem21.base, main_#t~mem21.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem21.base, main_#t~mem21.offset;call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem23.base, main_#t~mem23.offset);havoc main_#t~mem23.base, main_#t~mem23.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post24 := main_~length~0;main_~length~0 := main_#t~post24 - 1;havoc main_#t~post24; 394#L556-1 [2020-10-19 19:10:01,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:01,395 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2020-10-19 19:10:01,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:01,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656864975] [2020-10-19 19:10:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2020-10-19 19:10:01,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:01,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167069654] [2020-10-19 19:10:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,486 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2020-10-19 19:10:01,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:01,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137083235] [2020-10-19 19:10:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:01,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:01,570 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:31,117 WARN L193 SmtUtils]: Spent 29.42 s on a formula simplification. DAG size of input: 395 DAG size of output: 333 [2020-10-19 19:10:31,553 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:38,199 WARN L193 SmtUtils]: Spent 6.64 s on a formula simplification that was a NOOP. DAG size: 232 [2020-10-19 19:10:38,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:38,240 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:44,011 WARN L193 SmtUtils]: Spent 5.77 s on a formula simplification that was a NOOP. DAG size: 228 [2020-10-19 19:10:44,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:44,044 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:49,965 WARN L193 SmtUtils]: Spent 5.92 s on a formula simplification that was a NOOP. DAG size: 225 [2020-10-19 19:10:49,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:50,008 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:55,656 WARN L193 SmtUtils]: Spent 5.65 s on a formula simplification that was a NOOP. DAG size: 222 [2020-10-19 19:10:55,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:55,690 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:11:00,920 WARN L193 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 218 [2020-10-19 19:11:00,921 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:11:00,955 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:11:05,353 WARN L193 SmtUtils]: Spent 4.40 s on a formula simplification that was a NOOP. DAG size: 215 [2020-10-19 19:11:05,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:11:05,401 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2020-10-19 19:11:05,401 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:9823, output treesize:10065 [2020-10-19 19:11:09,747 WARN L193 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 215 [2020-10-19 19:11:09,752 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:11:09,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:11:09,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:11:09,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:11:09,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:11:09,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:11:09,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:11:09,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:11:09,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2020-10-19 19:11:09,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:11:09,754 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:11:09,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:09,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:11:12,170 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) 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:382) 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:320) 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) [2020-10-19 19:11:12,180 INFO L168 Benchmark]: Toolchain (without parser) took 95800.06 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.6 MB). Free memory was 953.2 MB in the beginning and 1.2 GB in the end (delta: -262.1 MB). Peak memory consumption was 557.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:12,183 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:11:12,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:12,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.93 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. [2020-10-19 19:11:12,188 INFO L168 Benchmark]: Boogie Preprocessor took 34.43 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. [2020-10-19 19:11:12,189 INFO L168 Benchmark]: RCFGBuilder took 525.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:12,189 INFO L168 Benchmark]: BuchiAutomizer took 94468.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 274.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.3 MB). Peak memory consumption was 547.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:11:12,196 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 704.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.93 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 34.43 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 525.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 94468.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 274.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.3 MB). Peak memory consumption was 547.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...