./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.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 5d0e37f725f553afaea418dbbe7c392bdc4622ea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-8bd4bc6 [2020-07-29 03:26:52,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:52,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:52,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:52,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:52,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:52,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:52,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:52,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:52,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:52,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:52,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:52,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:52,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:52,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:52,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:52,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:52,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:52,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:52,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:52,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:52,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:52,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:52,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:52,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:52,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:52,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:52,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:52,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:52,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:52,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:52,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:52,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:52,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:52,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:52,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:52,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:52,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:52,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:52,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:52,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:52,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:52,140 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:52,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:52,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:52,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:52,143 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:52,144 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:52,144 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:52,144 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:52,145 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:52,145 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:52,146 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:52,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:52,147 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:52,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:52,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:52,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:52,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:52,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:52,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:52,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:52,149 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:52,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:52,149 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:52,150 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:52,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:52,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:52,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:52,151 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:52,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:52,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:52,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:52,153 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:52,155 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:52,155 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 -> 5d0e37f725f553afaea418dbbe7c392bdc4622ea [2020-07-29 03:26:52,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:52,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:52,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:52,486 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:52,487 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:52,488 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2020-07-29 03:26:52,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4a038e1/8d0039d75c8642459d21b98bf5df23e2/FLAG7817539c0 [2020-07-29 03:26:53,110 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:53,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2020-07-29 03:26:53,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4a038e1/8d0039d75c8642459d21b98bf5df23e2/FLAG7817539c0 [2020-07-29 03:26:53,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4a038e1/8d0039d75c8642459d21b98bf5df23e2 [2020-07-29 03:26:53,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:53,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:53,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:53,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:53,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:53,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:53,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269a198f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53, skipping insertion in model container [2020-07-29 03:26:53,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:53,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:53,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:53,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:53,784 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:53,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:53,940 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:53,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53 WrapperNode [2020-07-29 03:26:53,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:53,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:53,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:53,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:53,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:53,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:54,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:54,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:54,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:54,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... [2020-07-29 03:26:54,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:54,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:54,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:54,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:54,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 03:26:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 03:26:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 03:26:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:54,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:54,839 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:54,839 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 03:26:54,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:54 BoogieIcfgContainer [2020-07-29 03:26:54,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:54,844 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:54,844 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:54,848 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:54,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:54,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:53" (1/3) ... [2020-07-29 03:26:54,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d0858ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:54, skipping insertion in model container [2020-07-29 03:26:54,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:54,851 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:53" (2/3) ... [2020-07-29 03:26:54,851 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d0858ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:54, skipping insertion in model container [2020-07-29 03:26:54,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:54,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:54" (3/3) ... [2020-07-29 03:26:54,853 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2020-07-29 03:26:54,909 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:54,910 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:54,910 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:54,910 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:54,912 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:54,913 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:54,913 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:54,913 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:54,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 03:26:54,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:54,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:54,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:54,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:54,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:54,969 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:54,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 03:26:54,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:54,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:54,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:54,975 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:54,975 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:54,984 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 11#L534-2true [2020-07-29 03:26:54,984 INFO L796 eck$LassoCheckResult]: Loop: 11#L534-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; 8#L524-2true assume !true; 23#L523-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 21#L529true 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; 26#L529-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L534true 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; 11#L534-2true [2020-07-29 03:26:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 03:26:55,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:55,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306555427] [2020-07-29 03:26:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:55,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:55,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:55,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-07-29 03:26:55,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:55,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745443612] [2020-07-29 03:26:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:55,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} 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#true} is VALID [2020-07-29 03:26:55,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume !true; {31#false} is VALID [2020-07-29 03:26:55,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#false} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {31#false} is VALID [2020-07-29 03:26:55,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {31#false} 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; {31#false} is VALID [2020-07-29 03:26:55,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {31#false} is VALID [2020-07-29 03:26:55,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#false} 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; {31#false} is VALID [2020-07-29 03:26:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:55,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745443612] [2020-07-29 03:26:55,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:55,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:26:55,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570375166] [2020-07-29 03:26:55,220 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:26:55,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 03:26:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 03:26:55,239 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-29 03:26:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:55,294 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-07-29 03:26:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:26:55,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:26:55,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:55,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-07-29 03:26:55,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:55,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2020-07-29 03:26:55,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:26:55,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:26:55,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2020-07-29 03:26:55,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:55,327 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-29 03:26:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2020-07-29 03:26:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 03:26:55,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:55,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 31 transitions. Second operand 20 states. [2020-07-29 03:26:55,358 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 31 transitions. Second operand 20 states. [2020-07-29 03:26:55,360 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 20 states. [2020-07-29 03:26:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:55,363 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2020-07-29 03:26:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-07-29 03:26:55,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:55,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:55,365 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 31 transitions. [2020-07-29 03:26:55,365 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 31 transitions. [2020-07-29 03:26:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:55,367 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2020-07-29 03:26:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-07-29 03:26:55,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:55,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:55,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:55,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:26:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-07-29 03:26:55,373 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-29 03:26:55,373 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-29 03:26:55,373 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:55,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2020-07-29 03:26:55,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:55,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:55,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:55,375 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:55,375 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:55,375 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 66#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 62#L534-2 [2020-07-29 03:26:55,376 INFO L796 eck$LassoCheckResult]: Loop: 62#L534-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; 59#L524-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; 64#L523-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; 65#L523-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 72#L523-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L529 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; 75#L529-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L534 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; 62#L534-2 [2020-07-29 03:26:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 03:26:55,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:55,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118424449] [2020-07-29 03:26:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:55,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:55,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:55,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-07-29 03:26:55,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:55,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453839341] [2020-07-29 03:26:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:55,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} 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; {121#true} is VALID [2020-07-29 03:26:55,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} 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; {123#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not |ULTIMATE.start_main_#t~short6|))} is VALID [2020-07-29 03:26:55,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {123#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not |ULTIMATE.start_main_#t~short6|))} 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; {124#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} is VALID [2020-07-29 03:26:55,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {124#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; {124#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} is VALID [2020-07-29 03:26:55,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {124#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {125#(or (not (= 0 |ULTIMATE.start_main_#t~mem10.base|)) (not (= 0 |ULTIMATE.start_main_#t~mem10.offset|)))} is VALID [2020-07-29 03:26:55,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(or (not (= 0 |ULTIMATE.start_main_#t~mem10.base|)) (not (= 0 |ULTIMATE.start_main_#t~mem10.offset|)))} 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; {122#false} is VALID [2020-07-29 03:26:55,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {122#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {122#false} is VALID [2020-07-29 03:26:55,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {122#false} 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; {122#false} is VALID [2020-07-29 03:26:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:55,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453839341] [2020-07-29 03:26:55,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:55,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:26:55,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100587177] [2020-07-29 03:26:55,629 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:26:55,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:26:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:26:55,630 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 03:26:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:55,915 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-07-29 03:26:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:26:55,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:55,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:55,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2020-07-29 03:26:55,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-07-29 03:26:55,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2020-07-29 03:26:55,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 03:26:55,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 03:26:55,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2020-07-29 03:26:55,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:55,949 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-07-29 03:26:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2020-07-29 03:26:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-07-29 03:26:55,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:55,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 41 transitions. Second operand 23 states. [2020-07-29 03:26:55,954 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 41 transitions. Second operand 23 states. [2020-07-29 03:26:55,954 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 23 states. [2020-07-29 03:26:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:55,957 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-07-29 03:26:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2020-07-29 03:26:55,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:55,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:55,959 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 27 states and 41 transitions. [2020-07-29 03:26:55,959 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 27 states and 41 transitions. [2020-07-29 03:26:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:55,962 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-07-29 03:26:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2020-07-29 03:26:55,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:55,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:55,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:55,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 03:26:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-07-29 03:26:55,966 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-29 03:26:55,966 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-29 03:26:55,967 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:55,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-07-29 03:26:55,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:26:55,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:55,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:55,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:55,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:55,969 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 167#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 161#L534-2 [2020-07-29 03:26:55,970 INFO L796 eck$LassoCheckResult]: Loop: 161#L534-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; 158#L524-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; 163#L523-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; 164#L523-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 176#L523-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 174#L529 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; 175#L529-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 160#L534 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; 161#L534-2 [2020-07-29 03:26:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-07-29 03:26:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:55,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125535669] [2020-07-29 03:26:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:55,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:55,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:55,995 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-07-29 03:26:55,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:55,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696459224] [2020-07-29 03:26:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:56,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:56,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:56,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-07-29 03:26:56,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:56,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610548748] [2020-07-29 03:26:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:56,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {239#true} is VALID [2020-07-29 03:26:56,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#true} 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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); {241#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)))} is VALID [2020-07-29 03:26:56,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {241#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)))} 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; {242#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)))} is VALID [2020-07-29 03:26:56,124 INFO L280 TraceCheckUtils]: 3: Hoare triple {242#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)))} 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; {243#(not |ULTIMATE.start_main_#t~short6|)} is VALID [2020-07-29 03:26:56,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {243#(not |ULTIMATE.start_main_#t~short6|)} 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; {240#false} is VALID [2020-07-29 03:26:56,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {240#false} assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; {240#false} is VALID [2020-07-29 03:26:56,126 INFO L280 TraceCheckUtils]: 6: Hoare triple {240#false} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {240#false} is VALID [2020-07-29 03:26:56,127 INFO L280 TraceCheckUtils]: 7: Hoare triple {240#false} 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; {240#false} is VALID [2020-07-29 03:26:56,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {240#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {240#false} is VALID [2020-07-29 03:26:56,128 INFO L280 TraceCheckUtils]: 9: Hoare triple {240#false} 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; {240#false} is VALID [2020-07-29 03:26:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:56,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610548748] [2020-07-29 03:26:56,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:56,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:26:56,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206277081] [2020-07-29 03:26:56,300 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-07-29 03:26:56,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:56,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:26:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:26:56,374 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-29 03:26:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:56,944 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2020-07-29 03:26:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:26:56,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:56,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:56,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2020-07-29 03:26:56,965 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2020-07-29 03:26:56,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2020-07-29 03:26:56,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-29 03:26:56,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-29 03:26:56,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2020-07-29 03:26:56,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:56,970 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2020-07-29 03:26:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2020-07-29 03:26:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2020-07-29 03:26:56,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:56,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 80 transitions. Second operand 31 states. [2020-07-29 03:26:56,973 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 80 transitions. Second operand 31 states. [2020-07-29 03:26:56,973 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand 31 states. [2020-07-29 03:26:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:56,977 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2020-07-29 03:26:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2020-07-29 03:26:56,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:56,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:56,978 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 54 states and 80 transitions. [2020-07-29 03:26:56,979 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 54 states and 80 transitions. [2020-07-29 03:26:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:56,982 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2020-07-29 03:26:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2020-07-29 03:26:56,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:56,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:56,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:56,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:26:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-29 03:26:56,986 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-29 03:26:56,986 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-29 03:26:56,986 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:56,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2020-07-29 03:26:56,987 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2020-07-29 03:26:56,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:56,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:56,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:56,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:56,988 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 315#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 313#L534-2 [2020-07-29 03:26:56,989 INFO L796 eck$LassoCheckResult]: Loop: 313#L534-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; 310#L524-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; 311#L523-1 assume !main_#t~short6; 312#L523-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 320#L523-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 324#L529 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; 325#L529-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 326#L534 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; 313#L534-2 [2020-07-29 03:26:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-07-29 03:26:56,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:56,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454090938] [2020-07-29 03:26:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:56,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:57,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:57,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-07-29 03:26:57,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:57,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146372876] [2020-07-29 03:26:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:57,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:57,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:57,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-07-29 03:26:57,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:57,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18156113] [2020-07-29 03:26:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:57,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:57,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:57,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:57,226 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-07-29 03:26:57,411 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2020-07-29 03:26:57,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:57 BoogieIcfgContainer [2020-07-29 03:26:57,577 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:57,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:57,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:57,578 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:57,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:54" (3/4) ... [2020-07-29 03:26:57,586 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 03:26:57,645 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 03:26:57,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:57,647 INFO L168 Benchmark]: Toolchain (without parser) took 4299.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -227.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:57,648 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:57,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:57,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.88 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:57,650 INFO L168 Benchmark]: Boogie Preprocessor took 42.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:57,651 INFO L168 Benchmark]: RCFGBuilder took 772.39 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:57,652 INFO L168 Benchmark]: BuchiAutomizer took 2733.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.5 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:57,652 INFO L168 Benchmark]: Witness Printer took 66.97 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:57,656 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.88 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.44 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 772.39 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2733.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.5 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. * Witness Printer took 66.97 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 521]: 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@5a5d115b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c0012a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7fdfc20c=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f205e1c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38ccf312=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cf94bf3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5531a60f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e97923d=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@345a01cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a5d115b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65bb18a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63ca23be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78532a7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29d286d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40db1469=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@212db717=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@345a01cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63ca23be=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78532a7b=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e97923d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@317e79a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7fdfc20c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a373ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3183448b=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38ccf312=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@11f13fd4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cf94bf3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@212db717=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@319b1471=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58259061=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dd3fe08=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@317e79a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@469bdf20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6f205e1c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5531a60f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@11f13fd4=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@33998782=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@319b1471=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@469bdf20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5b05401a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c0012a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a373ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3183448b=0, pred=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40db1469=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 521]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L518] struct TreeNode* root = malloc(sizeof(*root)), *n; [L519] root->left = ((void *)0) [L520] root->right = ((void *)0) Loop: [L521] COND TRUE __VERIFIER_nondet_int() [L522] n = root [L523] EXPR n->left [L523] n->left && n->right [L523] COND FALSE !(n->left && n->right) [L529] EXPR n->left [L529] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L534] EXPR n->right [L534] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...