./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/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_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/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-5842f4b [2018-11-18 08:35:41,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:35:41,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:35:41,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:35:41,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:35:41,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:35:41,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:35:41,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:35:41,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:35:41,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:35:41,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:35:41,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:35:41,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:35:41,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:35:41,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:35:41,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:35:41,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:35:41,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:35:41,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:35:41,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:35:41,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:35:41,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:35:41,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:35:41,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:35:41,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:35:41,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:35:41,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:35:41,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:35:41,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:35:41,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:35:41,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:35:41,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:35:41,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:35:41,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:35:41,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:35:41,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:35:41,668 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:35:41,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:35:41,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:35:41,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:35:41,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:35:41,677 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:35:41,677 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:35:41,677 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:35:41,677 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:35:41,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:35:41,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:35:41,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:35:41,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:35:41,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:35:41,680 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:35:41,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:35:41,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:35:41,680 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:35:41,681 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:35:41,681 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_a85ee47b-165b-41db-bd4b-a296bdf57c96/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-18 08:35:41,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:35:41,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:35:41,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:35:41,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:35:41,718 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:35:41,719 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-11-18 08:35:41,766 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/data/153176941/9cad339548ac44a08434856b2c7a376a/FLAG034a98faa [2018-11-18 08:35:42,123 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:35:42,123 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/sv-benchmarks/c/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-11-18 08:35:42,132 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/data/153176941/9cad339548ac44a08434856b2c7a376a/FLAG034a98faa [2018-11-18 08:35:42,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/data/153176941/9cad339548ac44a08434856b2c7a376a [2018-11-18 08:35:42,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:35:42,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:35:42,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:42,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:35:42,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:35:42,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34daa157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42, skipping insertion in model container [2018-11-18 08:35:42,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:35:42,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:35:42,756 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:42,762 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:35:42,794 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:42,817 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:35:42,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42 WrapperNode [2018-11-18 08:35:42,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:42,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:35:42,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:35:42,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:35:42,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:35:42,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:35:42,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:35:42,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:35:42,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... [2018-11-18 08:35:42,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:35:42,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:35:42,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:35:42,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:35:42,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/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-18 08:35:42,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:35:42,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:35:42,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:35:42,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:35:42,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:35:42,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:35:43,251 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:35:43,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:43 BoogieIcfgContainer [2018-11-18 08:35:43,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:35:43,252 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:35:43,252 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:35:43,255 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:35:43,255 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:43,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:35:42" (1/3) ... [2018-11-18 08:35:43,257 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@266e926a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:35:43, skipping insertion in model container [2018-11-18 08:35:43,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:43,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:42" (2/3) ... [2018-11-18 08:35:43,257 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@266e926a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:35:43, skipping insertion in model container [2018-11-18 08:35:43,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:43,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:43" (3/3) ... [2018-11-18 08:35:43,259 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-11-18 08:35:43,308 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:35:43,309 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:35:43,309 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:35:43,309 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:35:43,310 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:35:43,310 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:35:43,310 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:35:43,310 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:35:43,310 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:35:43,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-18 08:35:43,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 08:35:43,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:43,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:43,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:35:43,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:43,350 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:35:43,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-18 08:35:43,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 08:35:43,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:43,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:43,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:35:43,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:43,359 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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); 6#L645-2true [2018-11-18 08:35:43,360 INFO L796 eck$LassoCheckResult]: Loop: 6#L645-2true assume true; 10#L632-1true 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; 17#L634-6true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 14#L640true 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; 19#L640-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 25#L645true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, 4 + main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 6#L645-2true [2018-11-18 08:35:43,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 08:35:43,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1143178396, now seen corresponding path program 1 times [2018-11-18 08:35:43,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:43,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:43,502 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-18 08:35:43,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:43,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:35:43,507 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:35:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:35:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:35:43,519 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-18 08:35:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:43,524 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-11-18 08:35:43,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:35:43,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2018-11-18 08:35:43,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 08:35:43,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 28 transitions. [2018-11-18 08:35:43,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 08:35:43,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 08:35:43,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-11-18 08:35:43,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:43,533 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 08:35:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-11-18 08:35:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 08:35:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 08:35:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-11-18 08:35:43,557 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 08:35:43,557 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 08:35:43,557 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:35:43,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-11-18 08:35:43,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 08:35:43,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:43,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:43,558 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:35:43,558 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:43,559 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 71#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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); 61#L645-2 [2018-11-18 08:35:43,559 INFO L796 eck$LassoCheckResult]: Loop: 61#L645-2 assume true; 62#L632-1 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; 56#L635-2 assume true; 57#L634-1 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; 58#L634-2 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; 63#L634-4 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; 67#L634-6 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 69#L640 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; 70#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 73#L645 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, 4 + main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 61#L645-2 [2018-11-18 08:35:43,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 08:35:43,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1652939883, now seen corresponding path program 1 times [2018-11-18 08:35:43,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:43,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:43,679 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-18 08:35:43,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:43,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:35:43,679 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:35:43,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:43,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:43,680 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 08:35:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:43,783 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-18 08:35:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:35:43,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2018-11-18 08:35:43,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2018-11-18 08:35:43,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 39 transitions. [2018-11-18 08:35:43,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 08:35:43,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 08:35:43,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2018-11-18 08:35:43,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:43,788 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-18 08:35:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2018-11-18 08:35:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-11-18 08:35:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 08:35:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-11-18 08:35:43,791 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-18 08:35:43,791 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-18 08:35:43,791 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:35:43,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2018-11-18 08:35:43,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 08:35:43,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:43,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:43,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:35:43,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:43,792 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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); 119#L645-2 [2018-11-18 08:35:43,792 INFO L796 eck$LassoCheckResult]: Loop: 119#L645-2 assume true; 120#L632-1 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; 114#L635-2 assume true; 115#L634-1 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; 116#L634-2 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; 121#L634-4 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; 136#L634-6 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 128#L640 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; 129#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 133#L645 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, 4 + main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 119#L645-2 [2018-11-18 08:35:43,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,793 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 08:35:43,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:43,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1652937961, now seen corresponding path program 1 times [2018-11-18 08:35:43,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:43,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash 551674969, now seen corresponding path program 1 times [2018-11-18 08:35:43,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:43,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:43,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:43,932 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-18 08:35:43,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:43,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:35:44,460 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2018-11-18 08:35:44,849 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-18 08:35:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:44,850 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 08:35:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:44,956 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2018-11-18 08:35:44,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:35:44,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-11-18 08:35:44,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-18 08:35:44,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 53 transitions. [2018-11-18 08:35:44,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 08:35:44,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 08:35:44,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-11-18 08:35:44,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:44,959 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-18 08:35:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-11-18 08:35:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-11-18 08:35:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 08:35:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-18 08:35:44,961 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-18 08:35:44,961 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-18 08:35:44,961 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:35:44,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2018-11-18 08:35:44,962 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2018-11-18 08:35:44,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:44,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:44,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:35:44,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:44,963 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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); 208#L645-2 [2018-11-18 08:35:44,963 INFO L796 eck$LassoCheckResult]: Loop: 208#L645-2 assume true; 218#L632-1 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; 191#L635-2 assume true; 192#L634-1 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; 193#L634-2 assume !main_#t~short4; 198#L634-4 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; 223#L634-6 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 222#L640 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; 221#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 220#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 208#L645-2 [2018-11-18 08:35:44,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:44,963 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 08:35:44,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:44,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:44,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:44,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:44,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1595679657, now seen corresponding path program 1 times [2018-11-18 08:35:44,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:44,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:44,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:44,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash 608933273, now seen corresponding path program 1 times [2018-11-18 08:35:44,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:44,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:44,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:45,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:35:45 BoogieIcfgContainer [2018-11-18 08:35:45,265 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:35:45,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:35:45,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:35:45,266 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:35:45,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:43" (3/4) ... [2018-11-18 08:35:45,268 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 08:35:45,301 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a85ee47b-165b-41db-bd4b-a296bdf57c96/bin-2019/uautomizer/witness.graphml [2018-11-18 08:35:45,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:35:45,302 INFO L168 Benchmark]: Toolchain (without parser) took 2774.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 904.1 MB in the end (delta: 52.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,302 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:35:45,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,304 INFO L168 Benchmark]: Boogie Preprocessor took 18.73 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,304 INFO L168 Benchmark]: RCFGBuilder took 341.60 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,305 INFO L168 Benchmark]: BuchiAutomizer took 2013.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.8 MB in the end (delta: 200.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,305 INFO L168 Benchmark]: Witness Printer took 35.89 ms. Allocated memory is still 1.2 GB. Free memory was 906.8 MB in the beginning and 904.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:35:45,308 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.73 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 341.60 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2013.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.8 MB in the end (delta: 200.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. * Witness Printer took 35.89 ms. Allocated memory is still 1.2 GB. Free memory was 906.8 MB in the beginning and 904.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 33 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.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, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 32 SDslu, 81 SDs, 0 SdLazy, 104 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@412e6584=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cc460bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ae2a6ec=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66f9f51d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@14568663=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69dc4a02=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47816d87=0, root=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d07e275=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@412e6584=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7b4a1a9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6591b7c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79ef9ac2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2d07e275=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55fbaee8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6931de8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5db86aff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@20196ec4=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b25743b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35343b1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6931de8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1eedf30e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@442fd07d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@442fd07d=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@14568663=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71523b8f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69dc4a02=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36a936a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@146fdb58=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@20196ec4=0, n=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36a936a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f028a2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66f9f51d=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7b4a1a9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ff2e521=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62f64ca4=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47816d87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35343b1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71523b8f=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1fa5de53=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ff2e521=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5db86aff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55fbaee8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@385dfd98=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6591b7c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ae2a6ec=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1eedf30e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@385dfd98=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b25743b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7cc460bc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 632]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) Loop: [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL 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...