./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 f470102c 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.25-f470102 [2019-11-28 20:48:38,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:48:38,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:48:38,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:48:38,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:48:38,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:48:38,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:48:38,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:48:38,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:48:38,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:48:38,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:48:38,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:48:38,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:48:38,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:48:38,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:48:38,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:48:38,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:48:38,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:48:38,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:48:38,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:48:38,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:48:38,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:48:38,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:48:38,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:48:38,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:48:38,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:48:38,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:48:38,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:48:38,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:48:38,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:48:38,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:48:38,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:48:38,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:48:38,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:48:38,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:48:38,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:48:38,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:48:38,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:48:38,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:48:38,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:48:38,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:48:38,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:48:38,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:48:38,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:48:38,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:48:38,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:48:38,713 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:48:38,713 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:48:38,713 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:48:38,713 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:48:38,714 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:48:38,714 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:48:38,714 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:48:38,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:48:38,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:48:38,715 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:48:38,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:48:38,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:48:38,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:48:38,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:48:38,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:48:38,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:48:38,716 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:48:38,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:48:38,717 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:48:38,717 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:48:38,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:48:38,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:48:38,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:48:38,718 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:48:38,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:48:38,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:48:38,718 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:48:38,719 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:48:38,720 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:48:38,720 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 20:48:39,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:48:39,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:48:39,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:48:39,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:48:39,043 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:48:39,044 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 20:48:39,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723b62f1/75bf14d035354cd9aec7fca30ac5433f/FLAG3ba00a97d [2019-11-28 20:48:39,717 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:48:39,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-28 20:48:39,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723b62f1/75bf14d035354cd9aec7fca30ac5433f/FLAG3ba00a97d [2019-11-28 20:48:40,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723b62f1/75bf14d035354cd9aec7fca30ac5433f [2019-11-28 20:48:40,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:48:40,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:48:40,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:40,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:48:40,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:48:40,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e122a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40, skipping insertion in model container [2019-11-28 20:48:40,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:48:40,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:48:40,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:40,657 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:48:40,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:40,779 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:48:40,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40 WrapperNode [2019-11-28 20:48:40,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:40,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:40,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:48:40,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:48:40,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:40,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:48:40,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:48:40,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:48:40,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (1/1) ... [2019-11-28 20:48:40,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:48:40,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:48:40,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:48:40,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:48:40,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (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 20:48:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:48:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:48:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:48:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:48:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:48:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:48:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:48:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:48:41,563 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:48:41,563 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 20:48:41,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:41 BoogieIcfgContainer [2019-11-28 20:48:41,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:48:41,567 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:48:41,567 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:48:41,571 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:48:41,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:41,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:48:40" (1/3) ... [2019-11-28 20:48:41,575 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eb2db10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:41, skipping insertion in model container [2019-11-28 20:48:41,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:41,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:40" (2/3) ... [2019-11-28 20:48:41,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eb2db10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:41, skipping insertion in model container [2019-11-28 20:48:41,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:41,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:41" (3/3) ... [2019-11-28 20:48:41,582 INFO L371 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2019-11-28 20:48:41,637 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:48:41,638 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:48:41,638 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:48:41,638 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:48:41,638 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:48:41,638 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:48:41,638 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:48:41,639 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:48:41,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-28 20:48:41,675 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 20:48:41,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:41,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,683 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:48:41,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-28 20:48:41,687 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 20:48:41,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:41,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,695 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 20:48:41,696 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~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 8#L557-2true [2019-11-28 20:48:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:48:41,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528064787] [2019-11-28 20:48:41,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:41,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 20:48:41,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584785486] [2019-11-28 20:48:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:41,894 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 20:48:41,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584785486] [2019-11-28 20:48:41,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:41,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:48:41,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298767931] [2019-11-28 20:48:41,903 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:48:41,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:48:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:48:41,925 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-11-28 20:48:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:41,936 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2019-11-28 20:48:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:48:41,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2019-11-28 20:48:41,941 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 20:48:41,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2019-11-28 20:48:41,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-28 20:48:41,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 20:48:41,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2019-11-28 20:48:41,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:41,950 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-28 20:48:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2019-11-28 20:48:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 20:48:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:48:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-11-28 20:48:41,985 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-28 20:48:41,985 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-28 20:48:41,985 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:48:41,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2019-11-28 20:48:41,987 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-28 20:48:41,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:41,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:41,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:41,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:41,989 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 20:48:41,989 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~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.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~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 99#L557-2 [2019-11-28 20:48:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 20:48:41,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:41,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808744893] [2019-11-28 20:48:41,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 20:48:42,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660377744] [2019-11-28 20:48:42,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:42,150 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 20:48:42,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660377744] [2019-11-28 20:48:42,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:42,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:48:42,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205810986] [2019-11-28 20:48:42,152 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:48:42,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:48:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:48:42,154 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-28 20:48:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:42,362 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2019-11-28 20:48:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:48:42,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2019-11-28 20:48:42,365 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2019-11-28 20:48:42,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2019-11-28 20:48:42,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-28 20:48:42,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-28 20:48:42,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2019-11-28 20:48:42,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:42,370 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-11-28 20:48:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2019-11-28 20:48:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-11-28 20:48:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:48:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-11-28 20:48:42,376 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-11-28 20:48:42,376 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-11-28 20:48:42,377 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:48:42,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2019-11-28 20:48:42,378 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2019-11-28 20:48:42,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:42,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:42,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:42,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:42,380 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 20:48:42,380 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~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.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~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 190#L557-2 [2019-11-28 20:48:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 20:48:42,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299866405] [2019-11-28 20:48:42,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 20:48:42,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122640461] [2019-11-28 20:48:42,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:42,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:42,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:42,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 20:48:42,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:42,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551154006] [2019-11-28 20:48:42,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:42,601 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 20:48:42,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551154006] [2019-11-28 20:48:42,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:42,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:48:42,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923346286] [2019-11-28 20:48:42,802 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 20:48:42,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:48:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:48:42,902 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-11-28 20:48:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:43,280 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2019-11-28 20:48:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:48:43,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2019-11-28 20:48:43,284 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2019-11-28 20:48:43,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2019-11-28 20:48:43,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-11-28 20:48:43,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-28 20:48:43,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2019-11-28 20:48:43,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:43,298 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-11-28 20:48:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2019-11-28 20:48:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-11-28 20:48:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:48:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2019-11-28 20:48:43,309 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-11-28 20:48:43,310 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-11-28 20:48:43,310 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:48:43,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2019-11-28 20:48:43,311 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2019-11-28 20:48:43,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:43,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:43,315 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:43,317 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:43,318 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 20:48:43,318 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~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.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~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 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~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 351#L557-2 [2019-11-28 20:48:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 20:48:43,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:43,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818691691] [2019-11-28 20:48:43,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:43,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 20:48:43,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:43,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384041601] [2019-11-28 20:48:43,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:43,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 20:48:43,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:43,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88821918] [2019-11-28 20:48:43,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:43,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:43,611 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 20:48:43,918 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-28 20:48:43,950 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:44,015 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:44,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:44,018 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:110 [2019-11-28 20:48:44,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:48:44 BoogieIcfgContainer [2019-11-28 20:48:44,155 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:48:44,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:48:44,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:48:44,166 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:48:44,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:41" (3/4) ... [2019-11-28 20:48:44,174 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:48:44,281 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:48:44,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:48:44,283 INFO L168 Benchmark]: Toolchain (without parser) took 4233.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.0 MB in the beginning and 862.9 MB in the end (delta: 92.1 MB). Peak memory consumption was 232.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:44,284 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:48:44,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:44,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.83 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 20:48:44,286 INFO L168 Benchmark]: Boogie Preprocessor took 43.10 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 20:48:44,287 INFO L168 Benchmark]: RCFGBuilder took 671.93 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:44,288 INFO L168 Benchmark]: BuchiAutomizer took 2596.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.5 MB in the end (delta: 201.2 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:44,289 INFO L168 Benchmark]: Witness Printer took 118.21 ms. Allocated memory is still 1.2 GB. Free memory was 869.5 MB in the beginning and 862.9 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:48:44,293 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 731.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.83 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 43.10 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 671.93 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2596.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.5 MB in the end (delta: 201.2 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. * Witness Printer took 118.21 ms. Allocated memory is still 1.2 GB. Free memory was 869.5 MB in the beginning and 862.9 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. 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.4s 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@2bb5710f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51883e5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f21054f=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ba555f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@106a3bbb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bf7c4a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7772edbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16835e02=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a43c026=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2bb5710f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b6b879c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28e03952=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ee1b982=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4df2fa65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@452b2cb7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@53acc666=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a43c026=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28e03952=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ee1b982=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b773886=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16835e02=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@234d89db=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46dcc3b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f21054f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e6d7aec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@419d05cd=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@106a3bbb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61ce30b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b773886=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bf7c4a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@53acc666=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@99a63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b5d23f2=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25f52966=23, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f541651=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@300d2d97=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e917734=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46dcc3b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@234d89db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@729902cd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ba555f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7772edbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45e69a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@61ce30b6=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@31e2b9bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7076d7ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@99a63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45e69a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@729902cd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57c5cc99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c1d5756=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@427fb507=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29d0196f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e917734=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@560ca90d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51883e5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e6d7aec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@419d05cd=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57c5cc99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7076d7ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@560ca90d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5abe1525=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@452b2cb7=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...