./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer --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 fbf3b6e80b82aab76aa646445120e7c15e1e84e0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-aa41828 [2018-11-23 04:13:36,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:13:36,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:13:36,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:13:36,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:13:36,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:13:36,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:13:36,921 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:13:36,922 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:13:36,923 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:13:36,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:13:36,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:13:36,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:13:36,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:13:36,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:13:36,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:13:36,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:13:36,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:13:36,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:13:36,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:13:36,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:13:36,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:13:36,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:13:36,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:13:36,934 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:13:36,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:13:36,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:13:36,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:13:36,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:13:36,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:13:36,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:13:36,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:13:36,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:13:36,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:13:36,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:13:36,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:13:36,941 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 04:13:36,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:13:36,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:13:36,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:13:36,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:13:36,954 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:13:36,954 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:13:36,954 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:13:36,954 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:13:36,954 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:13:36,954 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:13:36,955 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:13:36,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:13:36,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:13:36,955 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:13:36,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:13:36,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:13:36,956 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:13:36,957 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:13:36,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:13:36,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:13:36,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:13:36,957 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:13:36,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:13:36,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:13:36,958 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:13:36,958 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:13:36,958 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer 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 -> fbf3b6e80b82aab76aa646445120e7c15e1e84e0 [2018-11-23 04:13:36,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:13:36,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:13:36,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:13:36,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:13:36,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:13:36,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-11-23 04:13:37,032 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/data/1784d2914/0cc6d2e45d104b728d32db4bb81976e8/FLAG7cf4f0750 [2018-11-23 04:13:37,465 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:13:37,465 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/sv-benchmarks/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-11-23 04:13:37,472 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/data/1784d2914/0cc6d2e45d104b728d32db4bb81976e8/FLAG7cf4f0750 [2018-11-23 04:13:37,480 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/data/1784d2914/0cc6d2e45d104b728d32db4bb81976e8 [2018-11-23 04:13:37,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:13:37,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:13:37,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:13:37,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:13:37,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:13:37,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d97fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37, skipping insertion in model container [2018-11-23 04:13:37,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:13:37,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:13:37,709 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:13:37,715 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:13:37,782 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:13:37,813 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:13:37,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37 WrapperNode [2018-11-23 04:13:37,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:13:37,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:13:37,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:13:37,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:13:37,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:13:37,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:13:37,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:13:37,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:13:37,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... [2018-11-23 04:13:37,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:13:37,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:13:37,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:13:37,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:13:37,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/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 [2018-11-23 04:13:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:13:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 04:13:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 04:13:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:13:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:13:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:13:38,169 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:13:38,169 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 04:13:38,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:13:38 BoogieIcfgContainer [2018-11-23 04:13:38,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:13:38,170 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:13:38,170 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:13:38,172 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:13:38,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:13:38,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:13:37" (1/3) ... [2018-11-23 04:13:38,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58264e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:13:38, skipping insertion in model container [2018-11-23 04:13:38,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:13:38,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:13:37" (2/3) ... [2018-11-23 04:13:38,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58264e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:13:38, skipping insertion in model container [2018-11-23 04:13:38,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:13:38,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:13:38" (3/3) ... [2018-11-23 04:13:38,176 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-11-23 04:13:38,211 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:13:38,212 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:13:38,212 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:13:38,212 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:13:38,212 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:13:38,212 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:13:38,212 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:13:38,212 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:13:38,212 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:13:38,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 04:13:38,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 04:13:38,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:13:38,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:13:38,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:13:38,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:13:38,247 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:13:38,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 04:13:38,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 04:13:38,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:13:38,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:13:38,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:13:38,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:13:38,256 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 5#L645-2true [2018-11-23 04:13:38,256 INFO L796 eck$LassoCheckResult]: Loop: 5#L645-2true assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L635-2true assume !true; 13#L634-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L640true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 16#L640-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#L645true assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 5#L645-2true [2018-11-23 04:13:38,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 04:13:38,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-23 04:13:38,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:13:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:13:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:13:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:13:38,389 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:13:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 04:13:38,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:13:38,399 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 04:13:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:13:38,405 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2018-11-23 04:13:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 04:13:38,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2018-11-23 04:13:38,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 04:13:38,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2018-11-23 04:13:38,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 04:13:38,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 04:13:38,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2018-11-23 04:13:38,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:13:38,412 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 04:13:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2018-11-23 04:13:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 04:13:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 04:13:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-11-23 04:13:38,430 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 04:13:38,430 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 04:13:38,430 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:13:38,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2018-11-23 04:13:38,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 04:13:38,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:13:38,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:13:38,431 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:13:38,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:13:38,432 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 53#L645-2 [2018-11-23 04:13:38,432 INFO L796 eck$LassoCheckResult]: Loop: 53#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 50#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 51#L634-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 52#L634-3 assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; 58#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L640 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 61#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 53#L645-2 [2018-11-23 04:13:38,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 04:13:38,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-23 04:13:38,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:13:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:13:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:13:38,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:13:38,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:13:38,562 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:13:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:13:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:13:38,562 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 04:13:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:13:38,642 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-11-23 04:13:38,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:13:38,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-11-23 04:13:38,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 04:13:38,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2018-11-23 04:13:38,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 04:13:38,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 04:13:38,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2018-11-23 04:13:38,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:13:38,647 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-11-23 04:13:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2018-11-23 04:13:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-23 04:13:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 04:13:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 04:13:38,650 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 04:13:38,650 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 04:13:38,650 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:13:38,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-23 04:13:38,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 04:13:38,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:13:38,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:13:38,651 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:13:38,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:13:38,651 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 105#L645-2 [2018-11-23 04:13:38,651 INFO L796 eck$LassoCheckResult]: Loop: 105#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 101#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 102#L634-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 103#L634-3 assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; 120#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L640 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; 113#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 105#L645-2 [2018-11-23 04:13:38,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 04:13:38,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-23 04:13:38,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:13:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:38,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-23 04:13:38,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:38,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:13:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:13:38,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:13:38,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:13:38,899 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-23 04:13:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:13:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:13:38,964 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 04:13:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:13:39,067 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-11-23 04:13:39,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:13:39,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2018-11-23 04:13:39,069 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-23 04:13:39,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2018-11-23 04:13:39,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 04:13:39,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 04:13:39,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2018-11-23 04:13:39,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:13:39,071 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2018-11-23 04:13:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2018-11-23 04:13:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-11-23 04:13:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 04:13:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-11-23 04:13:39,073 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-23 04:13:39,073 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-23 04:13:39,073 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:13:39,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-11-23 04:13:39,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-23 04:13:39,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:13:39,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:13:39,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:13:39,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:13:39,075 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 171#L645-2 [2018-11-23 04:13:39,075 INFO L796 eck$LassoCheckResult]: Loop: 171#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 168#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 169#L634-1 assume !main_#t~short4; 170#L634-3 assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; 195#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L640 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; 183#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 184#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 171#L645-2 [2018-11-23 04:13:39,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 04:13:39,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:39,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:39,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:39,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-23 04:13:39,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:39,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:39,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:13:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:39,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:13:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-23 04:13:39,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:13:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:13:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:13:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:13:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:13:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-23 04:13:39,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:13:39 BoogieIcfgContainer [2018-11-23 04:13:39,350 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:13:39,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:13:39,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:13:39,351 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:13:39,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:13:38" (3/4) ... [2018-11-23 04:13:39,354 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-23 04:13:39,392 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a93e35a1-08e5-45e9-94de-8aa94d0b9808/bin-2019/uautomizer/witness.graphml [2018-11-23 04:13:39,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:13:39,392 INFO L168 Benchmark]: Toolchain (without parser) took 1910.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.5 MB in the beginning and 937.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 171.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:13:39,393 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:13:39,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:13:39,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.13 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:13:39,395 INFO L168 Benchmark]: Boogie Preprocessor took 23.24 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:13:39,395 INFO L168 Benchmark]: RCFGBuilder took 299.54 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:13:39,395 INFO L168 Benchmark]: BuchiAutomizer took 1180.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.0 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:13:39,396 INFO L168 Benchmark]: Witness Printer took 41.43 ms. Allocated memory is still 1.2 GB. Free memory is still 937.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:13:39,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.13 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.24 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.54 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1180.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.0 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * Witness Printer took 41.43 ms. Allocated memory is still 1.2 GB. Free memory is still 937.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 632]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69aa3996=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66036cd7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d9fb9d7=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ee3e6f1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@706d54fb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5852d158=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@473f7929=0, root=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cf01a09=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69aa3996=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@197146ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f4d3fa9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@438bc944=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cf01a09=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a5644b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cc69f71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5edc443=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1c667430=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@499bf145=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ace2428=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cc69f71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40dc8408=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@115d55e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@115d55e1=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@706d54fb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66cc7af7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5852d158=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1544fea8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b983262=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1c667430=0, n=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1544fea8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36d86ea0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ee3e6f1=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@197146ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a83f408=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42d974f8=15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@473f7929=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ace2428=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66cc7af7=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@31c04ee6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a83f408=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5edc443=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a5644b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b3bdab4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f4d3fa9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d9fb9d7=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40dc8408=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b3bdab4=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@499bf145=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66036cd7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 632]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~malloc18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~malloc22, main_#t~mem23, main_#t~mem24, main_#t~malloc25, main_#t~mem26, main_~root~0, main_~n~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem2; [L634] havoc main_#t~mem3; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~nondet9; [L640] havoc main_#t~mem8; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem2; [L634] havoc #t~mem3; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~nondet9; [L640] havoc #t~mem8; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) Loop: [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...