./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eed6d14b3659ee573ecc9a025ea4a6cd48efa35c .................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-28 03:16:09,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:16:09,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:16:09,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:16:09,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:16:09,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:16:09,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:16:09,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:16:09,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:16:09,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:16:09,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:16:09,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:16:09,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:16:09,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:16:09,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:16:09,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:16:09,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:16:09,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:16:09,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:16:09,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:16:09,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:16:09,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:16:09,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:16:09,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:16:09,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:16:09,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:16:09,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:16:09,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:16:09,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:16:09,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:16:09,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:16:09,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:16:09,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:16:09,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:16:09,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:16:09,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:16:09,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:16:09,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:16:09,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:16:09,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:16:09,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:16:09,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:16:09,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:16:09,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:16:09,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:16:09,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:16:09,471 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:16:09,471 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:16:09,471 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:16:09,472 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:16:09,472 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:16:09,472 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:16:09,472 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:16:09,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:16:09,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:16:09,473 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:16:09,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:16:09,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:16:09,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:16:09,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:16:09,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:16:09,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:16:09,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:16:09,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:16:09,476 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:16:09,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:16:09,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:16:09,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:16:09,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:16:09,477 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:16:09,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:16:09,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:16:09,478 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:16:09,479 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:16:09,480 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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2019-11-28 03:16:09,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:16:09,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:16:09,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:16:09,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:16:09,803 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:16:09,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-28 03:16:09,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a417d235/5dd77178eaa7466fb52aac21728d83bd/FLAG34f01460c [2019-11-28 03:16:10,424 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:16:10,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-28 03:16:10,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a417d235/5dd77178eaa7466fb52aac21728d83bd/FLAG34f01460c [2019-11-28 03:16:10,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a417d235/5dd77178eaa7466fb52aac21728d83bd [2019-11-28 03:16:10,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:16:10,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:16:10,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:10,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:16:10,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:16:10,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7ce7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:10, skipping insertion in model container [2019-11-28 03:16:10,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:10" (1/1) ... [2019-11-28 03:16:10,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:16:10,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:16:11,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:11,301 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:16:11,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:11,402 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:16:11,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11 WrapperNode [2019-11-28 03:16:11,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:11,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:11,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:16:11,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:16:11,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:11,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:16:11,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:16:11,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:16:11,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (1/1) ... [2019-11-28 03:16:11,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:16:11,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:16:11,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:16:11,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:16:11,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (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 [2019-11-28 03:16:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:16:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:16:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:16:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:16:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:16:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:16:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:16:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:16:12,161 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:16:12,162 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 03:16:12,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:12 BoogieIcfgContainer [2019-11-28 03:16:12,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:16:12,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:16:12,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:16:12,168 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:16:12,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:12,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:10" (1/3) ... [2019-11-28 03:16:12,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19da80c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:12, skipping insertion in model container [2019-11-28 03:16:12,171 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:12,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:11" (2/3) ... [2019-11-28 03:16:12,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19da80c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:12, skipping insertion in model container [2019-11-28 03:16:12,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:12,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:12" (3/3) ... [2019-11-28 03:16:12,175 INFO L371 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2019-11-28 03:16:12,223 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:16:12,223 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:16:12,223 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:16:12,224 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:16:12,224 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:16:12,224 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:16:12,224 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:16:12,225 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:16:12,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-28 03:16:12,268 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 03:16:12,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:12,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:12,276 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:12,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:16:12,277 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:16:12,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-28 03:16:12,281 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 03:16:12,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:12,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:12,282 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:12,282 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:16:12,291 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 8#L557-2true [2019-11-28 03:16:12,292 INFO L796 eck$LassoCheckResult]: Loop: 8#L557-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 30#L547-2true assume !true; 40#L546-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 17#L552true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 23#L552-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L557true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 8#L557-2true [2019-11-28 03:16:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:16:12,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544437654] [2019-11-28 03:16:12,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 03:16:12,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174273742] [2019-11-28 03:16:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:12,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174273742] [2019-11-28 03:16:12,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:12,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:16:12,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548316850] [2019-11-28 03:16:12,580 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:16:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:16:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:16:12,602 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-11-28 03:16:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:12,618 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2019-11-28 03:16:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:16:12,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2019-11-28 03:16:12,632 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 03:16:12,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2019-11-28 03:16:12,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-28 03:16:12,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 03:16:12,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2019-11-28 03:16:12,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:12,642 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-28 03:16:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2019-11-28 03:16:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 03:16:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 03:16:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-11-28 03:16:12,682 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-28 03:16:12,682 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-28 03:16:12,682 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:16:12,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2019-11-28 03:16:12,687 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 03:16:12,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:12,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:12,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:12,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:12,688 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 114#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 99#L557-2 [2019-11-28 03:16:12,689 INFO L796 eck$LassoCheckResult]: Loop: 99#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 104#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 101#L546-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 102#L546-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 112#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 119#L552 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 120#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 98#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 99#L557-2 [2019-11-28 03:16:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:16:12,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29315066] [2019-11-28 03:16:12,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 03:16:12,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057146469] [2019-11-28 03:16:12,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:12,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057146469] [2019-11-28 03:16:12,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:12,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:16:12,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770816883] [2019-11-28 03:16:12,921 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:16:12,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:16:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:16:12,922 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-28 03:16:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:13,130 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2019-11-28 03:16:13,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:16:13,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2019-11-28 03:16:13,134 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2019-11-28 03:16:13,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2019-11-28 03:16:13,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-28 03:16:13,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-28 03:16:13,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2019-11-28 03:16:13,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:13,139 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-11-28 03:16:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2019-11-28 03:16:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-11-28 03:16:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 03:16:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-11-28 03:16:13,144 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-11-28 03:16:13,144 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-11-28 03:16:13,144 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:16:13,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2019-11-28 03:16:13,145 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2019-11-28 03:16:13,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:13,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:13,146 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:13,146 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:13,147 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 206#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 190#L557-2 [2019-11-28 03:16:13,147 INFO L796 eck$LassoCheckResult]: Loop: 190#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 196#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 192#L546-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 193#L546-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 226#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 211#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 212#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 189#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 190#L557-2 [2019-11-28 03:16:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 03:16:13,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658381929] [2019-11-28 03:16:13,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 03:16:13,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042279473] [2019-11-28 03:16:13,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 03:16:13,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466553279] [2019-11-28 03:16:13,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:13,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466553279] [2019-11-28 03:16:13,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:13,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:16:13,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204548044] [2019-11-28 03:16:13,534 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 03:16:13,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:16:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:16:13,631 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-11-28 03:16:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:13,990 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2019-11-28 03:16:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:16:13,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2019-11-28 03:16:13,993 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2019-11-28 03:16:13,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2019-11-28 03:16:13,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-11-28 03:16:13,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 03:16:13,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2019-11-28 03:16:13,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:13,997 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-11-28 03:16:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2019-11-28 03:16:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-11-28 03:16:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 03:16:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2019-11-28 03:16:14,003 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-11-28 03:16:14,003 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-11-28 03:16:14,003 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:16:14,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2019-11-28 03:16:14,006 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2019-11-28 03:16:14,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:14,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:14,008 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:16:14,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:14,010 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 350#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 351#L557-2 [2019-11-28 03:16:14,011 INFO L796 eck$LassoCheckResult]: Loop: 351#L557-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 366#L547-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 338#L546-1 assume !main_#t~short6; 339#L546-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 349#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 379#L552 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 359#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 360#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 351#L557-2 [2019-11-28 03:16:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 03:16:14,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:14,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75619326] [2019-11-28 03:16:14,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 03:16:14,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:14,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519007505] [2019-11-28 03:16:14,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 03:16:14,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:14,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957657042] [2019-11-28 03:16:14,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:14,250 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 03:16:14,369 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 03:16:14,568 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-28 03:16:14,603 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:14,670 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,672 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:14,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:110 [2019-11-28 03:16:14,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:14 BoogieIcfgContainer [2019-11-28 03:16:14,809 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:16:14,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:16:14,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:16:14,810 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:16:14,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:12" (3/4) ... [2019-11-28 03:16:14,814 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:16:14,878 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:16:14,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:16:14,880 INFO L168 Benchmark]: Toolchain (without parser) took 4120.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.3 MB in the beginning and 866.5 MB in the end (delta: 89.8 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:14,881 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:14,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:14,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:14,883 INFO L168 Benchmark]: Boogie Preprocessor took 52.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:14,884 INFO L168 Benchmark]: RCFGBuilder took 647.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:14,885 INFO L168 Benchmark]: BuchiAutomizer took 2644.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.5 MB in the end (delta: 203.7 MB). Peak memory consumption was 203.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:14,885 INFO L168 Benchmark]: Witness Printer took 68.96 ms. Allocated memory is still 1.2 GB. Free memory is still 866.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:14,889 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 647.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2644.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.5 MB in the end (delta: 203.7 MB). Peak memory consumption was 203.7 MB. Max. memory is 11.5 GB. * Witness Printer took 68.96 ms. Allocated memory is still 1.2 GB. Free memory is still 866.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 166 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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: 544]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1749d7e6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4da595c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a396398=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28b8699a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63ebccc9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f27b0ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e29489=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@455bacf7=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61177ba4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1749d7e6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79b10238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6126a62=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39a0833a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@580c3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69a9e9b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75a536ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61177ba4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6126a62=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39a0833a=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e58b276=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@455bacf7=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@111b199e=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e80f436=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a396398=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60a933fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@da1d3ea=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63ebccc9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15721ecf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e58b276=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f27b0ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75a536ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36295fe3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e4d6c0=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19f88c55=23, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6834e4b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5b2c482b=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50c6b5c7=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e80f436=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@111b199e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b2d772f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28b8699a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e29489=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fdc6e57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15721ecf=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4f8839cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4bc5c345=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36295fe3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fdc6e57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b2d772f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e8d1b7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31501cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@fd8a971=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4179b4e6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50c6b5c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb45ee8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4da595c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60a933fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@da1d3ea=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e8d1b7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4bc5c345=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb45ee8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6373fcf7=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69a9e9b3=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 544]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) Loop: [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...