./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/memsafety-ext/tree_dsw.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 0046771f7e99737dcb98805b185666cbe0afcb5f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:19:15,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:19:15,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:19:15,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:19:15,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:19:15,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:19:15,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:19:15,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:19:15,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:19:15,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:19:15,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:19:15,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:19:15,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:19:15,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:19:15,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:19:15,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:19:15,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:19:15,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:19:15,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:19:15,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:19:15,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:19:15,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:19:15,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:19:15,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:19:15,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:19:15,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:19:15,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:19:15,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:19:15,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:19:15,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:19:15,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:19:15,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:19:15,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:19:15,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:19:15,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:19:15,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:19:15,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:19:15,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:19:15,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:19:15,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:19:15,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:19:15,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:19:15,594 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:19:15,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:19:15,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:19:15,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:19:15,597 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:19:15,597 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:19:15,597 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:19:15,597 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:19:15,597 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:19:15,598 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:19:15,599 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:19:15,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:19:15,599 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:19:15,600 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:19:15,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:19:15,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:19:15,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:19:15,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:19:15,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:19:15,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:19:15,601 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:19:15,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:19:15,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:19:15,602 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:19:15,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:19:15,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:19:15,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:19:15,603 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:19:15,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:19:15,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:19:15,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:19:15,604 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:19:15,605 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:19:15,605 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 -> 0046771f7e99737dcb98805b185666cbe0afcb5f [2020-10-20 08:19:15,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:19:15,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:19:15,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:19:15,825 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:19:15,826 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:19:15,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2020-10-20 08:19:15,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad48e2f/6bc05ccbf2694b32978d6f3edfe0f729/FLAGd0ddbbc45 [2020-10-20 08:19:16,482 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:19:16,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2020-10-20 08:19:16,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad48e2f/6bc05ccbf2694b32978d6f3edfe0f729/FLAGd0ddbbc45 [2020-10-20 08:19:16,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad48e2f/6bc05ccbf2694b32978d6f3edfe0f729 [2020-10-20 08:19:16,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:19:16,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:19:16,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:16,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:19:16,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:19:16,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40835f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:16, skipping insertion in model container [2020-10-20 08:19:16,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:16" (1/1) ... [2020-10-20 08:19:16,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:19:16,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:19:17,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:17,231 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:19:17,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:17,337 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:19:17,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17 WrapperNode [2020-10-20 08:19:17,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:17,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:17,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:19:17,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:19:17,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:17,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:19:17,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:19:17,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:19:17,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (1/1) ... [2020-10-20 08:19:17,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:19:17,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:19:17,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:19:17,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:19:17,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (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-20 08:19:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 08:19:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 08:19:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:19:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 08:19:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:19:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:19:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:19:17,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:19:18,050 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:19:18,050 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 08:19:18,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:18 BoogieIcfgContainer [2020-10-20 08:19:18,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:19:18,052 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:19:18,052 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:19:18,058 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:19:18,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:18,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:19:16" (1/3) ... [2020-10-20 08:19:18,060 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@157bb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:18, skipping insertion in model container [2020-10-20 08:19:18,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:18,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:17" (2/3) ... [2020-10-20 08:19:18,060 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@157bb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:18, skipping insertion in model container [2020-10-20 08:19:18,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:18,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:18" (3/3) ... [2020-10-20 08:19:18,062 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2020-10-20 08:19:18,109 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:19:18,109 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:19:18,109 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:19:18,109 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:19:18,110 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:19:18,110 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:19:18,110 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:19:18,110 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:19:18,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-20 08:19:18,142 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-20 08:19:18,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:18,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:18,149 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:18,149 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:18,149 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:19:18,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-10-20 08:19:18,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-20 08:19:18,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:18,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:18,152 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:18,152 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:18,158 INFO L794 eck$LassoCheckResult]: Stem: 25#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(11); 8#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 18#L549-2true [2020-10-20 08:19:18,159 INFO L796 eck$LassoCheckResult]: Loop: 18#L549-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L539-2true assume !true; 22#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L544true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 24#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L549true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 18#L549-2true [2020-10-20 08:19:18,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:19:18,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479952963] [2020-10-20 08:19:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-20 08:19:18,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513808767] [2020-10-20 08:19:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:18,377 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-20 08:19:18,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513808767] [2020-10-20 08:19:18,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:18,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:19:18,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750138113] [2020-10-20 08:19:18,388 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:18,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:18,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:19:18,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:19:18,405 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2020-10-20 08:19:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:18,412 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2020-10-20 08:19:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:19:18,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2020-10-20 08:19:18,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-20 08:19:18,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2020-10-20 08:19:18,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 08:19:18,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 08:19:18,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2020-10-20 08:19:18,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:18,423 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-10-20 08:19:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2020-10-20 08:19:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-20 08:19:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 08:19:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2020-10-20 08:19:18,450 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-10-20 08:19:18,450 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-10-20 08:19:18,450 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:19:18,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2020-10-20 08:19:18,451 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-20 08:19:18,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:18,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:18,452 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:18,452 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:18,452 INFO L794 eck$LassoCheckResult]: Stem: 78#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(11); 75#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 63#L549-2 [2020-10-20 08:19:18,453 INFO L796 eck$LassoCheckResult]: Loop: 63#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 58#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 59#L538-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 60#L538-3 assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 68#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L544 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 73#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 77#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 63#L549-2 [2020-10-20 08:19:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 08:19:18,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536760868] [2020-10-20 08:19:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,494 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-20 08:19:18,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942620064] [2020-10-20 08:19:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:18,629 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-20 08:19:18,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942620064] [2020-10-20 08:19:18,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:18,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:18,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55368633] [2020-10-20 08:19:18,631 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:18,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:18,632 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-10-20 08:19:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:18,779 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-10-20 08:19:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:18,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2020-10-20 08:19:18,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-10-20 08:19:18,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2020-10-20 08:19:18,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 08:19:18,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 08:19:18,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-10-20 08:19:18,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:18,785 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-10-20 08:19:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-10-20 08:19:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-10-20 08:19:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 08:19:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2020-10-20 08:19:18,789 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-10-20 08:19:18,789 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-10-20 08:19:18,789 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:19:18,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2020-10-20 08:19:18,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-10-20 08:19:18,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:18,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:18,806 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:18,806 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:18,806 INFO L794 eck$LassoCheckResult]: Stem: 138#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(11); 135#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 123#L549-2 [2020-10-20 08:19:18,806 INFO L796 eck$LassoCheckResult]: Loop: 123#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 117#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 118#L538-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 119#L538-3 assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 128#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L544 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 133#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 137#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 123#L549-2 [2020-10-20 08:19:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 08:19:18,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267941717] [2020-10-20 08:19:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,885 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-20 08:19:18,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615588821] [2020-10-20 08:19:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:18,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:18,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-20 08:19:18,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:18,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620765565] [2020-10-20 08:19:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:19,042 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-20 08:19:19,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620765565] [2020-10-20 08:19:19,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:19,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:19,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765921402] [2020-10-20 08:19:19,206 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-20 08:19:19,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:19,290 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-10-20 08:19:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:19,552 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2020-10-20 08:19:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:19:19,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2020-10-20 08:19:19,554 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2020-10-20 08:19:19,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2020-10-20 08:19:19,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-10-20 08:19:19,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-10-20 08:19:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2020-10-20 08:19:19,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:19,557 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-10-20 08:19:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2020-10-20 08:19:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2020-10-20 08:19:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 08:19:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-10-20 08:19:19,561 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-10-20 08:19:19,561 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-10-20 08:19:19,561 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:19:19,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2020-10-20 08:19:19,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2020-10-20 08:19:19,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:19,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:19,563 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:19,563 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:19,563 INFO L794 eck$LassoCheckResult]: Stem: 218#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(11); 214#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L549-2 [2020-10-20 08:19:19,563 INFO L796 eck$LassoCheckResult]: Loop: 215#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 195#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 196#L538-1 assume !main_#t~short9; 197#L538-3 assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 226#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L544 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 223#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 215#L549-2 [2020-10-20 08:19:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 08:19:19,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363893581] [2020-10-20 08:19:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,584 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-20 08:19:19,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203080089] [2020-10-20 08:19:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,600 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-20 08:19:19,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359764519] [2020-10-20 08:19:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,631 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:19,746 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-20 08:19:20,124 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-10-20 08:19:20,185 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-20 08:19:20,291 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:19:20,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:20,294 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:20,294 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-10-20 08:19:20,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:20 BoogieIcfgContainer [2020-10-20 08:19:20,490 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:20,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:20,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:20,491 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:20,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:18" (3/4) ... [2020-10-20 08:19:20,504 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:19:20,609 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:19:20,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:20,611 INFO L168 Benchmark]: Toolchain (without parser) took 3808.66 ms. Allocated memory was 39.8 MB in the beginning and 58.7 MB in the end (delta: 18.9 MB). Free memory was 16.2 MB in the beginning and 35.4 MB in the end (delta: -19.3 MB). There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:19:20,612 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 30.9 MB. Free memory was 16.9 MB in the beginning and 16.9 MB in the end (delta: 31.1 kB). Peak memory consumption was 31.1 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.06 ms. Allocated memory was 39.8 MB in the beginning and 42.5 MB in the end (delta: 2.6 MB). Free memory was 15.3 MB in the beginning and 15.8 MB in the end (delta: -437.2 kB). Peak memory consumption was 6.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.86 ms. Allocated memory is still 42.5 MB. Free memory was 15.8 MB in the beginning and 13.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,615 INFO L168 Benchmark]: Boogie Preprocessor took 36.96 ms. Allocated memory is still 42.5 MB. Free memory was 13.4 MB in the beginning and 11.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,616 INFO L168 Benchmark]: RCFGBuilder took 622.92 ms. Allocated memory was 42.5 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Free memory was 11.1 MB in the beginning and 27.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,617 INFO L168 Benchmark]: BuchiAutomizer took 2438.13 ms. Allocated memory was 44.6 MB in the beginning and 58.7 MB in the end (delta: 14.2 MB). Free memory was 27.2 MB in the beginning and 37.1 MB in the end (delta: -9.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,618 INFO L168 Benchmark]: Witness Printer took 119.10 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 35.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:20,626 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.26 ms. Allocated memory is still 30.9 MB. Free memory was 16.9 MB in the beginning and 16.9 MB in the end (delta: 31.1 kB). Peak memory consumption was 31.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 530.06 ms. Allocated memory was 39.8 MB in the beginning and 42.5 MB in the end (delta: 2.6 MB). Free memory was 15.3 MB in the beginning and 15.8 MB in the end (delta: -437.2 kB). Peak memory consumption was 6.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 52.86 ms. Allocated memory is still 42.5 MB. Free memory was 15.8 MB in the beginning and 13.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 36.96 ms. Allocated memory is still 42.5 MB. Free memory was 13.4 MB in the beginning and 11.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 622.92 ms. Allocated memory was 42.5 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Free memory was 11.1 MB in the beginning and 27.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 2438.13 ms. Allocated memory was 44.6 MB in the beginning and 58.7 MB in the end (delta: 14.2 MB). Free memory was 27.2 MB in the beginning and 37.1 MB in the end (delta: -9.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 14.3 GB. * Witness Printer took 119.10 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 35.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1316} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e835ba1=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@12bc4bac=0, NULL=1318, NULL=1316, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b47ece2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fc80bb4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35fb77f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66d69c25=0, root=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2be5fbc0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ddcdfd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e835ba1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7acf5eaf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b7fa7fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@344682b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3850318a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c25bd5e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ddcdfd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@575278c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d195a2d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@441847b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d195a2d=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35fb77f4=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2be5fbc0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a0992ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b47ece2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e318721=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a14fd1e=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@475c6e7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fb80aac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@441847b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35946258=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39786bda=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a0992ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fc80bb4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bc24540=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3af27807=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a14fd1e=0, n=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3af27807=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e3ba6ba=28, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e318721=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@12bc4bac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b7fa7fc=0, sentinel=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66d69c25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1297150d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fb80aac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39786bda=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2de50ea7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bc24540=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1297150d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@575278c8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3850318a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d2b24db=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35946258=0, pred=0, s=0, NULL=1317, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d2b24db=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@475c6e7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...