./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.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/simple-ext.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 8dfe6e301265e265404ce5be2c9f54235040b69e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 19:09:33,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:09:33,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:09:33,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:09:33,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:09:33,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:09:33,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:09:33,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:09:33,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:09:33,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:09:33,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:09:33,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:09:33,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:09:33,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:09:33,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:09:33,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:09:33,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:09:33,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:09:33,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:09:33,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:09:33,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:09:33,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:09:33,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:09:33,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:09:33,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:09:33,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:09:33,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:09:33,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:09:33,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:09:33,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:09:33,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:09:33,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:09:33,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:09:33,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:09:33,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:09:33,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:09:33,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:09:33,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:09:33,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:09:33,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:09:33,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:09:33,129 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:33,156 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:09:33,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:09:33,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:09:33,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:09:33,158 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:09:33,159 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:09:33,159 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:09:33,159 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:09:33,159 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:09:33,159 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:09:33,160 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:09:33,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:09:33,160 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:09:33,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:09:33,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:09:33,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:09:33,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:09:33,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:09:33,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:09:33,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:09:33,162 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:09:33,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:09:33,162 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:09:33,162 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:09:33,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:09:33,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:09:33,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:09:33,163 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:09:33,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:09:33,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:09:33,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:09:33,164 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:09:33,165 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:09:33,165 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 -> 8dfe6e301265e265404ce5be2c9f54235040b69e [2020-10-19 19:09:33,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:09:33,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:09:33,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:09:33,506 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:09:33,506 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:09:33,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-10-19 19:09:33,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193401c2a/272140e0a6ed454e8828f4e81afa7191/FLAG220e958b4 [2020-10-19 19:09:34,107 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:09:34,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-10-19 19:09:34,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193401c2a/272140e0a6ed454e8828f4e81afa7191/FLAG220e958b4 [2020-10-19 19:09:34,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193401c2a/272140e0a6ed454e8828f4e81afa7191 [2020-10-19 19:09:34,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:09:34,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:09:34,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:34,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:09:34,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:09:34,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:34" (1/1) ... [2020-10-19 19:09:34,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311c8b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:34, skipping insertion in model container [2020-10-19 19:09:34,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:34" (1/1) ... [2020-10-19 19:09:34,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:09:34,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:09:34,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:34,934 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:09:34,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:35,045 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:09:35,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:35 WrapperNode [2020-10-19 19:09:35,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:35,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:35,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:09:35,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:09:35,056 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:35" (1/1) ... [2020-10-19 19:09:35,071 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:35" (1/1) ... [2020-10-19 19:09:35,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:35,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:09:35,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:09:35,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:09:35,101 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:35" (1/1) ... [2020-10-19 19:09:35,102 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:35" (1/1) ... [2020-10-19 19:09:35,106 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:35" (1/1) ... [2020-10-19 19:09:35,106 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:35" (1/1) ... [2020-10-19 19:09:35,114 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:35" (1/1) ... [2020-10-19 19:09:35,119 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:35" (1/1) ... [2020-10-19 19:09:35,121 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:35" (1/1) ... [2020-10-19 19:09:35,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:09:35,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:09:35,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:09:35,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:09:35,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:35" (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:35,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 19:09:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 19:09:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 19:09:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 19:09:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:09:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 19:09:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 19:09:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:09:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:09:35,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:09:35,601 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:09:35,601 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-10-19 19:09:35,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:35 BoogieIcfgContainer [2020-10-19 19:09:35,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:09:35,604 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:09:35,604 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:09:35,608 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:09:35,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:35,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:09:34" (1/3) ... [2020-10-19 19:09:35,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73fcaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:35, skipping insertion in model container [2020-10-19 19:09:35,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:35,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:35" (2/3) ... [2020-10-19 19:09:35,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73fcaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:35, skipping insertion in model container [2020-10-19 19:09:35,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:35,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:35" (3/3) ... [2020-10-19 19:09:35,613 INFO L373 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2020-10-19 19:09:35,663 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:09:35,663 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:09:35,663 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:09:35,663 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:09:35,664 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:09:35,664 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:09:35,664 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:09:35,664 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:09:35,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-10-19 19:09:35,700 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-10-19 19:09:35,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:35,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:35,706 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 19:09:35,707 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:09:35,707 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:09:35,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-10-19 19:09:35,709 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-10-19 19:09:35,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:35,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:35,710 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 19:09:35,710 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:09:35,717 INFO L794 eck$LassoCheckResult]: Stem: 16#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(13); 13#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 11#L533true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L525true [2020-10-19 19:09:35,717 INFO L796 eck$LassoCheckResult]: Loop: 5#L525true assume true; 5#L525true [2020-10-19 19:09:35,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-19 19:09:35,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:35,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43022674] [2020-10-19 19:09:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:35,915 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:35,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43022674] [2020-10-19 19:09:35,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:35,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 19:09:35,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753020835] [2020-10-19 19:09:35,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2020-10-19 19:09:35,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:35,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873705175] [2020-10-19 19:09:35,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:35,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:35,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:35,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:35,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:35,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:09:35,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:09:35,988 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-10-19 19:09:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:36,012 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-10-19 19:09:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:09:36,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-10-19 19:09:36,017 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 19:09:36,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2020-10-19 19:09:36,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 19:09:36,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 19:09:36,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-10-19 19:09:36,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:36,026 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-19 19:09:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-10-19 19:09:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-19 19:09:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 19:09:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-10-19 19:09:36,057 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-19 19:09:36,058 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-19 19:09:36,058 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:09:36,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-10-19 19:09:36,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-19 19:09:36,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:36,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:36,060 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 19:09:36,060 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:09:36,061 INFO L794 eck$LassoCheckResult]: Stem: 63#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(13); 62#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 60#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 61#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 56#L537-2 [2020-10-19 19:09:36,061 INFO L796 eck$LassoCheckResult]: Loop: 56#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 58#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 64#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 56#L537-2 [2020-10-19 19:09:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2020-10-19 19:09:36,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:36,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299232110] [2020-10-19 19:09:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:36,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:36,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:36,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2020-10-19 19:09:36,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:36,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749557718] [2020-10-19 19:09:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:36,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:36,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:36,163 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2020-10-19 19:09:36,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:36,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365503097] [2020-10-19 19:09:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:36,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:36,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:36,223 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:36,575 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2020-10-19 19:09:36,643 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:36,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:36,749 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:36,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:36,836 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:36,837 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2020-10-19 19:09:37,132 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-10-19 19:09:37,242 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-19 19:09:37,252 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:09:37,253 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:09:37,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:09:37,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:09:37,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:09:37,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:37,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:09:37,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:09:37,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2020-10-19 19:09:37,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:09:37,256 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:09:37,282 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:37,294 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:37,556 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-10-19 19:09:37,684 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:37,688 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:37,691 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:37,695 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:37,699 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:37,703 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:37,707 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:37,709 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:37,713 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:37,716 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:37,719 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:37,723 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:37,726 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:37,728 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:37,731 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:37,734 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:37,737 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:37,740 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:38,127 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2020-10-19 19:09:38,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:09:38,331 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:38,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:38,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:38,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:38,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:38,352 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:38,355 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) [2020-10-19 19:09:38,431 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:38,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:38,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:38,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:38,447 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) [2020-10-19 19:09:38,489 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:38,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:38,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:38,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:38,503 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) [2020-10-19 19:09:38,543 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:38,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:38,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:38,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:38,563 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:38,594 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:38,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:38,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:38,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:38,610 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) [2020-10-19 19:09:38,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:38,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:38,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:38,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:38,688 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:38,734 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:38,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:38,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:38,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:38,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:38,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:38,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:38,755 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:09:38,877 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-19 19:09:38,877 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 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:38,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 19:09:38,897 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:09:38,897 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:09:38,898 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2020-10-19 19:09:38,959 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-10-19 19:09:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:09:39,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:09:39,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:39,053 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:39,058 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 19:09:39,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-19 19:09:39,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2020-10-19 19:09:39,117 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:09:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:09:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-19 19:09:39,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-19 19:09:39,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:09:39,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-19 19:09:39,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:09:39,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-19 19:09:39,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:09:39,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-19 19:09:39,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-19 19:09:39,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-10-19 19:09:39,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 19:09:39,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 19:09:39,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-19 19:09:39,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:09:39,129 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-19 19:09:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-19 19:09:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-19 19:09:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 19:09:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-10-19 19:09:39,132 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-19 19:09:39,133 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-19 19:09:39,133 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:09:39,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-10-19 19:09:39,134 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-19 19:09:39,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,135 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,135 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:09:39,136 INFO L794 eck$LassoCheckResult]: Stem: 175#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(13); 174#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 172#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 173#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 166#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 167#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 162#L549-2 [2020-10-19 19:09:39,136 INFO L796 eck$LassoCheckResult]: Loop: 162#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 164#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 161#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 162#L549-2 [2020-10-19 19:09:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2020-10-19 19:09:39,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049131352] [2020-10-19 19:09:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,179 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 69961, now seen corresponding path program 1 times [2020-10-19 19:09:39,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134088290] [2020-10-19 19:09:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,198 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2102157079, now seen corresponding path program 1 times [2020-10-19 19:09:39,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110364884] [2020-10-19 19:09:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,263 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:39,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110364884] [2020-10-19 19:09:39,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:39,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:09:39,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901862841] [2020-10-19 19:09:39,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:09:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:09:39,342 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-19 19:09:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:39,439 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-19 19:09:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:09:39,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2020-10-19 19:09:39,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2020-10-19 19:09:39,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2020-10-19 19:09:39,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 19:09:39,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 19:09:39,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-10-19 19:09:39,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 19:09:39,446 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-19 19:09:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-10-19 19:09:39,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2020-10-19 19:09:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-19 19:09:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-10-19 19:09:39,451 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-19 19:09:39,451 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-19 19:09:39,451 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:09:39,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-10-19 19:09:39,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-19 19:09:39,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,453 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,453 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:09:39,454 INFO L794 eck$LassoCheckResult]: Stem: 236#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(13); 235#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 233#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 234#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 226#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 229#L540 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 232#L525-1 [2020-10-19 19:09:39,454 INFO L796 eck$LassoCheckResult]: Loop: 232#L525-1 assume true; 232#L525-1 [2020-10-19 19:09:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,454 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2020-10-19 19:09:39,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076698319] [2020-10-19 19:09:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,480 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:39,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076698319] [2020-10-19 19:09:39,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:39,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 19:09:39,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421641316] [2020-10-19 19:09:39,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2020-10-19 19:09:39,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038599309] [2020-10-19 19:09:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:09:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:09:39,492 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-19 19:09:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:39,501 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-10-19 19:09:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:09:39,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-10-19 19:09:39,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-19 19:09:39,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2020-10-19 19:09:39,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 19:09:39,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 19:09:39,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-10-19 19:09:39,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:39,505 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-19 19:09:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-10-19 19:09:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-10-19 19:09:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 19:09:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-19 19:09:39,507 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-19 19:09:39,508 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-19 19:09:39,508 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:09:39,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-10-19 19:09:39,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:39,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,510 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,510 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-19 19:09:39,510 INFO L794 eck$LassoCheckResult]: Stem: 277#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(13); 276#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 274#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 275#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 269#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 270#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 266#L549-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 267#L549-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 268#L557-2 [2020-10-19 19:09:39,510 INFO L796 eck$LassoCheckResult]: Loop: 268#L557-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 268#L557-2 [2020-10-19 19:09:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash 206358793, now seen corresponding path program 1 times [2020-10-19 19:09:39,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294394] [2020-10-19 19:09:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,548 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:39,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294394] [2020-10-19 19:09:39,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:39,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:09:39,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255883656] [2020-10-19 19:09:39,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2020-10-19 19:09:39,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297098501] [2020-10-19 19:09:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,562 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:39,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:09:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:09:39,607 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-19 19:09:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:39,660 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-10-19 19:09:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:09:39,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-10-19 19:09:39,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:39,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2020-10-19 19:09:39,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 19:09:39,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 19:09:39,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-19 19:09:39,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:39,664 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-19 19:09:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-19 19:09:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-10-19 19:09:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:09:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-10-19 19:09:39,667 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-19 19:09:39,667 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-19 19:09:39,667 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:09:39,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-10-19 19:09:39,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:39,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,669 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,669 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:09:39,670 INFO L794 eck$LassoCheckResult]: Stem: 327#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(13); 326#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 324#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 325#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 320#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 321#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 328#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 322#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 323#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 316#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-10-19 19:09:39,670 INFO L796 eck$LassoCheckResult]: Loop: 317#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 314#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 315#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-10-19 19:09:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2020-10-19 19:09:39,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009939449] [2020-10-19 19:09:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,727 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 2 times [2020-10-19 19:09:39,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471218158] [2020-10-19 19:09:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -60215300, now seen corresponding path program 1 times [2020-10-19 19:09:39,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268448307] [2020-10-19 19:09:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:39,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268448307] [2020-10-19 19:09:39,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329641267] [2020-10-19 19:09:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 19:09:39,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:39,958 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:09:39,959 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:39,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:39,963 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:09:39,964 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-19 19:09:40,033 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,034 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-19 19:09:40,035 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:40,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,053 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-10-19 19:09:40,054 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:40,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:09:40,067 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-10-19 19:09:40,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:09:40,121 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-19 19:09:40,122 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:40,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:40,134 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:21 [2020-10-19 19:09:40,206 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-19 19:09:40,206 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2020-10-19 19:09:40,207 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:40,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,222 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:09:40,223 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2020-10-19 19:09:40,271 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 19:09:40,274 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,274 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 15 treesize of output 10 [2020-10-19 19:09:40,277 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:40,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:40,289 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:09:40,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2020-10-19 19:09:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:40,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:40,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-10-19 19:09:40,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243210915] [2020-10-19 19:09:40,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-19 19:09:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-19 19:09:40,373 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2020-10-19 19:09:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:40,755 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-19 19:09:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 19:09:40,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-19 19:09:40,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:40,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2020-10-19 19:09:40,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 19:09:40,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 19:09:40,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-10-19 19:09:40,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:40,761 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-10-19 19:09:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-10-19 19:09:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2020-10-19 19:09:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-19 19:09:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-19 19:09:40,765 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-19 19:09:40,765 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-19 19:09:40,765 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 19:09:40,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-19 19:09:40,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:40,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:40,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:40,768 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:40,768 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 19:09:40,769 INFO L794 eck$LassoCheckResult]: Stem: 434#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(13); 433#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 431#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 432#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 426#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 427#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 435#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 428#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 429#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 437#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 436#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 430#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 422#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-10-19 19:09:40,769 INFO L796 eck$LassoCheckResult]: Loop: 423#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 420#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 421#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-10-19 19:09:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2020-10-19 19:09:40,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242006618] [2020-10-19 19:09:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 3 times [2020-10-19 19:09:40,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629514567] [2020-10-19 19:09:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,913 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 500499473, now seen corresponding path program 2 times [2020-10-19 19:09:40,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445928276] [2020-10-19 19:09:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:41,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445928276] [2020-10-19 19:09:41,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411224125] [2020-10-19 19:09:41,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:41,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 19:09:41,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:41,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 52 conjunts are in the unsatisfiable core [2020-10-19 19:09:41,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:41,199 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:09:41,199 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-19 19:09:41,281 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-19 19:09:41,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,327 INFO L625 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2020-10-19 19:09:41,332 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-10-19 19:09:41,333 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,354 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,354 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2020-10-19 19:09:41,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:09:41,409 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-19 19:09:41,410 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2020-10-19 19:09:41,516 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,516 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-19 19:09:41,517 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,548 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-19 19:09:41,549 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,570 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,571 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2020-10-19 19:09:41,687 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-19 19:09:41,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2020-10-19 19:09:41,690 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,713 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,713 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:48 [2020-10-19 19:09:41,919 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2020-10-19 19:09:41,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:41,960 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.3 percent of original size [2020-10-19 19:09:41,968 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,968 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2020-10-19 19:09:42,067 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 19:09:42,069 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 19:09:42,073 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:42,073 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2020-10-19 19:09:42,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:09:42,079 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:09:42,103 INFO L625 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2020-10-19 19:09:42,106 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:09:42,107 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2020-10-19 19:09:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:42,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:42,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-19 19:09:42,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998123480] [2020-10-19 19:09:42,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-19 19:09:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-10-19 19:09:42,170 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2020-10-19 19:09:56,811 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2020-10-19 19:09:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:56,842 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-10-19 19:09:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 19:09:56,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2020-10-19 19:09:56,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:09:56,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-10-19 19:09:56,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 19:09:56,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 19:09:56,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 19:09:56,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:56,844 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:09:56,844 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:09:56,844 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:09:56,845 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 19:09:56,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 19:09:56,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:09:56,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 19:09:56,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 07:09:56 BoogieIcfgContainer [2020-10-19 19:09:56,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 19:09:56,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 19:09:56,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 19:09:56,852 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 19:09:56,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:35" (3/4) ... [2020-10-19 19:09:56,856 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 19:09:56,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 19:09:56,857 INFO L168 Benchmark]: Toolchain (without parser) took 22418.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 954.6 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:56,858 INFO L168 Benchmark]: CDTParser took 0.19 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:09:56,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:56,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:09:56,859 INFO L168 Benchmark]: Boogie Preprocessor took 32.65 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:09:56,859 INFO L168 Benchmark]: RCFGBuilder took 478.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:56,860 INFO L168 Benchmark]: BuchiAutomizer took 21247.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.8 MB). Peak memory consumption was 83.0 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:56,860 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:09:56,863 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.19 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 602.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.65 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 478.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21247.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.8 MB). Peak memory consumption was 83.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 13.4s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 152 SDslu, 58 SDs, 0 SdLazy, 316 SolverSat, 62 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax107 hnf100 lsp88 ukn51 mio100 lsp29 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf175 smp93 tf100 neg95 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...