./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/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 275864fd23c88e3a2867d84f3947ff5231f6c6d6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-02 06:12:49,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:12:49,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:12:49,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:12:49,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:12:49,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:12:49,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:12:49,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:12:49,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:12:49,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:12:49,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:12:49,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:12:49,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:12:49,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:12:49,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:12:49,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:12:49,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:12:49,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:12:49,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:12:49,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:12:49,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:12:49,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:12:49,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:12:49,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:12:49,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:12:49,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:12:49,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:12:49,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:12:49,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:12:49,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:12:49,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:12:49,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:12:49,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:12:49,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:12:49,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:12:49,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:12:49,292 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 06:12:49,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:12:49,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:12:49,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:12:49,301 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 06:12:49,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:12:49,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 06:12:49,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:12:49,302 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 06:12:49,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:12:49,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:12:49,303 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 06:12:49,303 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 06:12:49,303 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_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/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 -> 275864fd23c88e3a2867d84f3947ff5231f6c6d6 [2018-12-02 06:12:49,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:12:49,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:12:49,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:12:49,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:12:49,333 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:12:49,333 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-12-02 06:12:49,370 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/data/3d001a178/6ea52536a282496d9cd4f4845e0bb43c/FLAGb4d7ea66d [2018-12-02 06:12:49,835 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:12:49,835 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-12-02 06:12:49,842 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/data/3d001a178/6ea52536a282496d9cd4f4845e0bb43c/FLAGb4d7ea66d [2018-12-02 06:12:49,850 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/data/3d001a178/6ea52536a282496d9cd4f4845e0bb43c [2018-12-02 06:12:49,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:12:49,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:12:49,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:12:49,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:12:49,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:12:49,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:12:49" (1/1) ... [2018-12-02 06:12:49,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cabf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:49, skipping insertion in model container [2018-12-02 06:12:49,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:12:49" (1/1) ... [2018-12-02 06:12:49,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:12:49,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:12:50,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:12:50,024 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:12:50,086 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:12:50,118 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:12:50,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50 WrapperNode [2018-12-02 06:12:50,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:12:50,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:12:50,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:12:50,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:12:50,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:12:50,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:12:50,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:12:50,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:12:50,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... [2018-12-02 06:12:50,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:12:50,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:12:50,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:12:50,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:12:50,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/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-12-02 06:12:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:12:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 06:12:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 06:12:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:12:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:12:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:12:50,395 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:12:50,395 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 06:12:50,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:12:50 BoogieIcfgContainer [2018-12-02 06:12:50,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:12:50,395 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 06:12:50,396 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 06:12:50,399 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 06:12:50,399 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:12:50,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:12:49" (1/3) ... [2018-12-02 06:12:50,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@740633f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:12:50, skipping insertion in model container [2018-12-02 06:12:50,400 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:12:50,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:12:50" (2/3) ... [2018-12-02 06:12:50,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@740633f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:12:50, skipping insertion in model container [2018-12-02 06:12:50,400 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:12:50,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:12:50" (3/3) ... [2018-12-02 06:12:50,401 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-12-02 06:12:50,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:12:50,432 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 06:12:50,432 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 06:12:50,432 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 06:12:50,432 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:12:50,432 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:12:50,432 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 06:12:50,432 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:12:50,432 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 06:12:50,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-02 06:12:50,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 06:12:50,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:12:50,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:12:50,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:12:50,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 06:12:50,459 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 06:12:50,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-02 06:12:50,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 06:12:50,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:12:50,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:12:50,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:12:50,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 06:12:50,467 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~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); 10#L641-2true [2018-12-02 06:12:50,468 INFO L796 eck$LassoCheckResult]: Loop: 10#L641-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; 8#L631-2true assume !true; 23#L630-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 20#L636true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;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; 26#L636-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L641true 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; 10#L641-2true [2018-12-02 06:12:50,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 06:12:50,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-12-02 06:12:50,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:12:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:12:50,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:12:50,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 06:12:50,581 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 06:12:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 06:12:50,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 06:12:50,591 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-12-02 06:12:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:12:50,596 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-12-02 06:12:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 06:12:50,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-12-02 06:12:50,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 06:12:50,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2018-12-02 06:12:50,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 06:12:50,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 06:12:50,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2018-12-02 06:12:50,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:12:50,602 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-02 06:12:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2018-12-02 06:12:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 06:12:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 06:12:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-12-02 06:12:50,618 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-02 06:12:50,619 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-02 06:12:50,619 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 06:12:50,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-12-02 06:12:50,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-02 06:12:50,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:12:50,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:12:50,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:12:50,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:12:50,620 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~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); 62#L641-2 [2018-12-02 06:12:50,620 INFO L796 eck$LassoCheckResult]: Loop: 62#L641-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; 59#L631-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; 64#L630-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; 65#L630-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; 72#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L636 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;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; 75#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L641 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; 62#L641-2 [2018-12-02 06:12:50,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 06:12:50,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:50,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-12-02 06:12:50,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:12:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:12:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:12:50,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:12:50,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:12:50,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 06:12:50,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:12:50,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:12:50,688 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-02 06:12:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:12:50,760 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2018-12-02 06:12:50,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:12:50,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2018-12-02 06:12:50,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-12-02 06:12:50,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2018-12-02 06:12:50,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 06:12:50,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-02 06:12:50,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2018-12-02 06:12:50,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:12:50,764 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2018-12-02 06:12:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2018-12-02 06:12:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-12-02 06:12:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 06:12:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-12-02 06:12:50,766 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-12-02 06:12:50,766 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-12-02 06:12:50,766 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 06:12:50,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-12-02 06:12:50,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-02 06:12:50,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:12:50,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:12:50,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:12:50,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:12:50,767 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~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); 119#L641-2 [2018-12-02 06:12:50,767 INFO L796 eck$LassoCheckResult]: Loop: 119#L641-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; 116#L631-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; 121#L630-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; 122#L630-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; 134#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L636 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 133#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 118#L641 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; 119#L641-2 [2018-12-02 06:12:50,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 06:12:50,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-12-02 06:12:50,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:12:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:50,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-12-02 06:12:50,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:50,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:12:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:12:50,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:12:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:12:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:12:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:12:50,969 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 06:12:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:12:51,076 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2018-12-02 06:12:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:12:51,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2018-12-02 06:12:51,077 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2018-12-02 06:12:51,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2018-12-02 06:12:51,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-02 06:12:51,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-02 06:12:51,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2018-12-02 06:12:51,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:12:51,079 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2018-12-02 06:12:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2018-12-02 06:12:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2018-12-02 06:12:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 06:12:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-12-02 06:12:51,081 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-02 06:12:51,081 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-02 06:12:51,081 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 06:12:51,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-12-02 06:12:51,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-12-02 06:12:51,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:12:51,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:12:51,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:12:51,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:12:51,082 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#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~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~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); 215#L641-2 [2018-12-02 06:12:51,082 INFO L796 eck$LassoCheckResult]: Loop: 215#L641-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; 212#L631-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; 213#L630-1 assume !main_#t~short4; 214#L630-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; 234#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L636 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 228#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 229#L641 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; 215#L641-2 [2018-12-02 06:12:51,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-02 06:12:51,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:51,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:51,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:51,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-12-02 06:12:51,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:51,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:51,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:12:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:51,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:12:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-12-02 06:12:51,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:12:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:12:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:51,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:12:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:12:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:12:51,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 06:12:51 BoogieIcfgContainer [2018-12-02 06:12:51,341 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 06:12:51,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:12:51,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:12:51,341 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:12:51,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:12:50" (3/4) ... [2018-12-02 06:12:51,344 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 06:12:51,370 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a1c9b45b-a744-4ec5-adce-e53f6fc77f15/bin-2019/uautomizer/witness.graphml [2018-12-02 06:12:51,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:12:51,371 INFO L168 Benchmark]: Toolchain (without parser) took 1518.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 922.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:12:51,372 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:12:51,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 06:12:51,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.56 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-12-02 06:12:51,373 INFO L168 Benchmark]: Boogie Preprocessor took 18.21 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-12-02 06:12:51,373 INFO L168 Benchmark]: RCFGBuilder took 229.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:12:51,373 INFO L168 Benchmark]: BuchiAutomizer took 945.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 925.9 MB in the end (delta: 172.9 MB). Peak memory consumption was 172.9 MB. Max. memory is 11.5 GB. [2018-12-02 06:12:51,374 INFO L168 Benchmark]: Witness Printer took 29.62 ms. Allocated memory is still 1.2 GB. Free memory was 925.9 MB in the beginning and 922.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:12:51,376 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.56 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 18.21 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 229.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 945.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 925.9 MB in the end (delta: 172.9 MB). Peak memory consumption was 172.9 MB. Max. memory is 11.5 GB. * Witness Printer took 29.62 ms. Allocated memory is still 1.2 GB. Free memory was 925.9 MB in the beginning and 922.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. 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, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.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: 628]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bc78c5b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ea99a08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b7d38f4=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f3126f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@622bbdd1=0, root=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c9cb7ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bf8bd31=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bc78c5b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d832573=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2857652b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bf8bd31=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b1729fa=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c9cb7ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e22e40f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3eabf0eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65857716=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b1729fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@492394c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@388a0ced=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@388a0ced=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31f7fbbb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3807e6ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51c495f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@364459ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e22e40f=0, n=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51c495f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73f10ef7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f3126f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d832573=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@146f92d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d9b0249=17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@622bbdd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2c9e32e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65857716=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31f7fbbb=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3807e6ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@73777c16=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@146f92d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@128ad77=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b7d38f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@492394c0=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@128ad77=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3eabf0eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ea99a08=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 628]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) Loop: [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...