./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.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_stack.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 a0142cb115f7d1e16772bca3adcba9f1aba5ac12 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:19:17,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:19:17,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:19:17,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:19:17,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:19:17,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:19:17,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:19:17,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:19:17,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:19:17,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:19:17,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:19:17,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:19:17,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:19:17,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:19:17,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:19:17,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:19:17,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:19:17,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:19:17,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:19:17,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:19:17,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:19:17,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:19:17,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:19:17,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:19:17,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:19:17,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:19:17,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:19:17,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:19:17,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:19:17,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:19:17,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:19:17,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:19:17,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:19:17,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:19:17,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:19:17,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:19:17,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:19:17,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:19:17,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:19:17,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:19:17,308 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:17,347 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:19:17,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:19:17,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:19:17,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:19:17,351 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:19:17,351 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:19:17,351 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:19:17,352 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:19:17,352 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:19:17,352 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:19:17,352 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:19:17,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:19:17,353 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:19:17,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:19:17,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:19:17,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:19:17,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:19:17,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:19:17,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:19:17,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:19:17,355 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:19:17,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:19:17,355 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:19:17,355 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:19:17,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:19:17,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:19:17,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:19:17,356 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:19:17,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:19:17,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:19:17,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:19:17,357 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:19:17,358 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:19:17,359 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 -> a0142cb115f7d1e16772bca3adcba9f1aba5ac12 [2020-10-20 08:19:17,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:19:17,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:19:17,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:19:17,600 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:19:17,601 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:19:17,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2020-10-20 08:19:17,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3855cf270/6a2b9cc916bd4b72bcbecba858f14bd1/FLAG2dc77ab6e [2020-10-20 08:19:18,264 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:19:18,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2020-10-20 08:19:18,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3855cf270/6a2b9cc916bd4b72bcbecba858f14bd1/FLAG2dc77ab6e [2020-10-20 08:19:18,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3855cf270/6a2b9cc916bd4b72bcbecba858f14bd1 [2020-10-20 08:19:18,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:19:18,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:19:18,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:18,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:19:18,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:19:18,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16005ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18, skipping insertion in model container [2020-10-20 08:19:18,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:19:18,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:19:18,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:18,992 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:19:19,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:19,131 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:19:19,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:19 WrapperNode [2020-10-20 08:19:19,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:19,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:19,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:19:19,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:19:19,146 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:19" (1/1) ... [2020-10-20 08:19:19,165 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:19" (1/1) ... [2020-10-20 08:19:19,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:19,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:19:19,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:19:19,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:19:19,206 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:19" (1/1) ... [2020-10-20 08:19:19,206 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:19" (1/1) ... [2020-10-20 08:19:19,210 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:19" (1/1) ... [2020-10-20 08:19:19,211 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:19" (1/1) ... [2020-10-20 08:19:19,221 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:19" (1/1) ... [2020-10-20 08:19:19,226 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:19" (1/1) ... [2020-10-20 08:19:19,228 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:19" (1/1) ... [2020-10-20 08:19:19,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:19:19,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:19:19,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:19:19,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:19:19,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:19" (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:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 08:19:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 08:19:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:19:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 08:19:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:19:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:19:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:19:19,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:19:19,848 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:19:19,849 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 08:19:19,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:19 BoogieIcfgContainer [2020-10-20 08:19:19,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:19:19,852 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:19:19,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:19:19,856 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:19:19,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:19,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:19:18" (1/3) ... [2020-10-20 08:19:19,859 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cc1dc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:19, skipping insertion in model container [2020-10-20 08:19:19,859 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:19,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:19" (2/3) ... [2020-10-20 08:19:19,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cc1dc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:19, skipping insertion in model container [2020-10-20 08:19:19,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:19,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:19" (3/3) ... [2020-10-20 08:19:19,862 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2020-10-20 08:19:19,908 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:19:19,908 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:19:19,908 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:19:19,908 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:19:19,908 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:19:19,909 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:19:19,909 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:19:19,909 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:19:19,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 08:19:19,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:19,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:19,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:19,953 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:19,954 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:19,954 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:19:19,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 08:19:19,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:19,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:19,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:19,956 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:19,957 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:19,963 INFO L794 eck$LassoCheckResult]: Stem: 17#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); 14#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 5#L549-2true [2020-10-20 08:19:19,964 INFO L796 eck$LassoCheckResult]: Loop: 5#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; 13#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L544true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;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; 16#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#L549true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 5#L549-2true [2020-10-20 08:19:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:19:19,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863583882] [2020-10-20 08:19:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,158 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-20 08:19:20,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419819177] [2020-10-20 08:19:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:20,220 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:20,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419819177] [2020-10-20 08:19:20,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:20,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:19:20,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811355966] [2020-10-20 08:19:20,226 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:20,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:19:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:19:20,242 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-10-20 08:19:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:20,249 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-10-20 08:19:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:19:20,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2020-10-20 08:19:20,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:20,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2020-10-20 08:19:20,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:19:20,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:19:20,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-10-20 08:19:20,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:20,259 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:19:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-10-20 08:19:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-20 08:19:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:19:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-10-20 08:19:20,286 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:19:20,286 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:19:20,286 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:19:20,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-10-20 08:19:20,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:20,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:20,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:20,288 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:20,288 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:20,289 INFO L794 eck$LassoCheckResult]: Stem: 65#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); 63#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 53#L549-2 [2020-10-20 08:19:20,289 INFO L796 eck$LassoCheckResult]: Loop: 53#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; 50#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; 51#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; 52#L538-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 58#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L544 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;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; 61#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 53#L549-2 [2020-10-20 08:19:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 08:19:20,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641843795] [2020-10-20 08:19:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,336 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-20 08:19:20,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047214419] [2020-10-20 08:19:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:20,486 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:20,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047214419] [2020-10-20 08:19:20,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:20,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:20,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343113197] [2020-10-20 08:19:20,488 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:20,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:20,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:20,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:20,489 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 08:19:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:20,648 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-10-20 08:19:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:20,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-10-20 08:19:20,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-10-20 08:19:20,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2020-10-20 08:19:20,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 08:19:20,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 08:19:20,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2020-10-20 08:19:20,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:20,654 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-10-20 08:19:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2020-10-20 08:19:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-10-20 08:19:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:19:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-10-20 08:19:20,658 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:19:20,659 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:19:20,659 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:19:20,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-10-20 08:19:20,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:20,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:20,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:20,661 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:20,661 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:20,661 INFO L794 eck$LassoCheckResult]: Stem: 118#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); 115#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 105#L549-2 [2020-10-20 08:19:20,661 INFO L796 eck$LassoCheckResult]: Loop: 105#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; 101#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; 102#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; 103#L538-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 120#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L544 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 113#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 105#L549-2 [2020-10-20 08:19:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 08:19:20,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29524141] [2020-10-20 08:19:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,738 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:20,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-20 08:19:20,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973465076] [2020-10-20 08:19:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,790 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-20 08:19:20,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038700014] [2020-10-20 08:19:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:20,865 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:20,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038700014] [2020-10-20 08:19:20,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:20,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:20,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747914510] [2020-10-20 08:19:21,045 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-20 08:19:21,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:21,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:21,107 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-10-20 08:19:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:21,323 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-10-20 08:19:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:19:21,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2020-10-20 08:19:21,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-10-20 08:19:21,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2020-10-20 08:19:21,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 08:19:21,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 08:19:21,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2020-10-20 08:19:21,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:21,327 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-10-20 08:19:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2020-10-20 08:19:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-10-20 08:19:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 08:19:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-10-20 08:19:21,331 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 08:19:21,332 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 08:19:21,332 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:19:21,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-10-20 08:19:21,333 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-10-20 08:19:21,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:21,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:21,333 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:21,334 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:21,334 INFO L794 eck$LassoCheckResult]: Stem: 185#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); 181#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 171#L549-2 [2020-10-20 08:19:21,334 INFO L796 eck$LassoCheckResult]: Loop: 171#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; 168#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; 169#L538-1 assume !main_#t~short9; 170#L538-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 195#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L544 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 183#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 184#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 171#L549-2 [2020-10-20 08:19:21,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 08:19:21,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889440720] [2020-10-20 08:19:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,361 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-20 08:19:21,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138123443] [2020-10-20 08:19:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-20 08:19:21,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414935824] [2020-10-20 08:19:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,448 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,617 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-20 08:19:21,992 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-10-20 08:19:22,038 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:22,179 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:19:22,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:22,181 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:22,182 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-10-20 08:19:22,313 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 08:19:22,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:22 BoogieIcfgContainer [2020-10-20 08:19:22,366 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:22,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:22,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:22,367 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:22,368 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:19" (3/4) ... [2020-10-20 08:19:22,372 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:19:22,421 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:19:22,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:22,423 INFO L168 Benchmark]: Toolchain (without parser) took 3890.40 ms. Allocated memory was 34.6 MB in the beginning and 59.2 MB in the end (delta: 24.6 MB). Free memory was 10.5 MB in the beginning and 19.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,424 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 33.0 MB. Free memory was 18.1 MB in the beginning and 18.1 MB in the end (delta: 41.9 kB). Peak memory consumption was 41.9 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.76 ms. Allocated memory was 34.6 MB in the beginning and 43.5 MB in the end (delta: 8.9 MB). Free memory was 9.7 MB in the beginning and 25.7 MB in the end (delta: -16.0 MB). Peak memory consumption was 9.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 43.5 MB. Free memory was 25.7 MB in the beginning and 23.4 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:22,426 INFO L168 Benchmark]: Boogie Preprocessor took 37.44 ms. Allocated memory is still 43.5 MB. Free memory was 23.4 MB in the beginning and 21.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,427 INFO L168 Benchmark]: RCFGBuilder took 619.01 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 21.2 MB in the beginning and 23.9 MB in the end (delta: -2.7 MB). Peak memory consumption was 12.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,428 INFO L168 Benchmark]: BuchiAutomizer took 2514.68 ms. Allocated memory was 45.1 MB in the beginning and 59.2 MB in the end (delta: 14.2 MB). Free memory was 23.9 MB in the beginning and 21.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,429 INFO L168 Benchmark]: Witness Printer took 54.79 ms. Allocated memory is still 59.2 MB. Free memory was 21.8 MB in the beginning and 19.5 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:22,433 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 33.0 MB. Free memory was 18.1 MB in the beginning and 18.1 MB in the end (delta: 41.9 kB). Peak memory consumption was 41.9 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 595.76 ms. Allocated memory was 34.6 MB in the beginning and 43.5 MB in the end (delta: 8.9 MB). Free memory was 9.7 MB in the beginning and 25.7 MB in the end (delta: -16.0 MB). Peak memory consumption was 9.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 43.5 MB. Free memory was 25.7 MB in the beginning and 23.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 37.44 ms. Allocated memory is still 43.5 MB. Free memory was 23.4 MB in the beginning and 21.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 619.01 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 21.2 MB in the beginning and 23.9 MB in the end (delta: -2.7 MB). Peak memory consumption was 12.0 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 2514.68 ms. Allocated memory was 45.1 MB in the beginning and 59.2 MB in the end (delta: 14.2 MB). Free memory was 23.9 MB in the beginning and 21.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 14.3 GB. * Witness Printer took 54.79 ms. Allocated memory is still 59.2 MB. Free memory was 21.8 MB in the beginning and 19.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 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=1464} State at position 1 is {s=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63d9cb80=0, NULL=1465, NULL=1464, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@138c2b20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@45a22dc2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54a3e623=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e070a6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f7b33ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c586fbc=0, root=1463, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@264ffaa8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e2f6b64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@45a22dc2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@345651cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@45b13ec1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ee58664=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cd83a53=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e2f6b64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@240a0767=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27713380=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@240a0767=1463, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e070a6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@264ffaa8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c586fbc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@138c2b20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4f960f9=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cec008e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2abb0882=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27713380=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e9ae2e3=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@431004bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5de55b57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@54a3e623=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@503f47ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23077f5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4f960f9=0, n=1463, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23077f5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@458f57a7=26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@432b77f2=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63d9cb80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@45b13ec1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f7b33ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2abb0882=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5de55b57=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3936021e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@503f47ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ff9a8a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@431004bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@432b77f2=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e9ae2e3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ff9a8a=0, s=0, NULL=1466, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cec008e=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...