./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/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 0046771f7e99737dcb98805b185666cbe0afcb5f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-a4ecdab [2020-11-30 00:22:17,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:22:17,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:22:17,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:22:17,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:22:17,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:22:17,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:22:17,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:22:17,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:22:17,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:22:17,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:22:17,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:22:17,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:22:17,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:22:17,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:22:17,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:22:17,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:22:17,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:22:17,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:22:17,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:22:17,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:22:17,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:22:17,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:22:17,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:22:17,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:22:17,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:22:17,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:22:17,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:22:17,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:22:17,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:22:17,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:22:17,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:22:17,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:22:17,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:22:17,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:22:17,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:22:17,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:22:17,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:22:17,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:22:17,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:22:17,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:22:17,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:22:17,389 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:22:17,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:22:17,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:22:17,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:22:17,392 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:22:17,393 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:22:17,393 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:22:17,393 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:22:17,394 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:22:17,394 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:22:17,395 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:22:17,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:22:17,399 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:22:17,399 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:22:17,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:22:17,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:22:17,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:22:17,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:22:17,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:22:17,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:22:17,400 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:22:17,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:22:17,401 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:22:17,401 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:22:17,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:22:17,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:22:17,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:22:17,403 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:22:17,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:22:17,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:22:17,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:22:17,406 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:22:17,408 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:22:17,408 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/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 -> 0046771f7e99737dcb98805b185666cbe0afcb5f [2020-11-30 00:22:17,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:22:17,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:22:17,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:22:17,755 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:22:17,756 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:22:17,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2020-11-30 00:22:17,842 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/data/348cc4dcb/e17850c1ccff43df962b8912b68b959c/FLAGe6acfa977 [2020-11-30 00:22:18,447 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:22:18,447 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2020-11-30 00:22:18,469 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/data/348cc4dcb/e17850c1ccff43df962b8912b68b959c/FLAGe6acfa977 [2020-11-30 00:22:18,722 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/data/348cc4dcb/e17850c1ccff43df962b8912b68b959c [2020-11-30 00:22:18,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:22:18,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:22:18,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:22:18,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:22:18,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:22:18,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:22:18" (1/1) ... [2020-11-30 00:22:18,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e8900d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:18, skipping insertion in model container [2020-11-30 00:22:18,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:22:18" (1/1) ... [2020-11-30 00:22:18,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:22:18,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:22:19,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:22:19,213 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:22:19,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:22:19,347 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:22:19,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19 WrapperNode [2020-11-30 00:22:19,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:22:19,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:22:19,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:22:19,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:22:19,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:22:19,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:22:19,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:22:19,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:22:19,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... [2020-11-30 00:22:19,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:22:19,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:22:19,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:22:19,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:22:19,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/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 [2020-11-30 00:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:22:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:22:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:22:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:22:20,194 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:22:20,195 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-30 00:22:20,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:22:20 BoogieIcfgContainer [2020-11-30 00:22:20,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:22:20,200 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:22:20,200 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:22:20,204 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:22:20,206 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:22:20,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:22:18" (1/3) ... [2020-11-30 00:22:20,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35628da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:22:20, skipping insertion in model container [2020-11-30 00:22:20,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:22:20,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:22:19" (2/3) ... [2020-11-30 00:22:20,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35628da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:22:20, skipping insertion in model container [2020-11-30 00:22:20,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:22:20,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:22:20" (3/3) ... [2020-11-30 00:22:20,211 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2020-11-30 00:22:20,272 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:22:20,273 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:22:20,273 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:22:20,273 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:22:20,273 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:22:20,274 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:22:20,274 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:22:20,274 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:22:20,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-11-30 00:22:20,313 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-11-30 00:22:20,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:22:20,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:22:20,321 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:22:20,321 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:22:20,322 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:22:20,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-11-30 00:22:20,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-11-30 00:22:20,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:22:20,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:22:20,326 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:22:20,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:22:20,334 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11); 8#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, 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_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 18#L549-2true [2020-11-30 00:22:20,335 INFO L796 eck$LassoCheckResult]: Loop: 18#L549-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L539-2true assume !true; 22#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L544true 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.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 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, 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; 24#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L549true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 18#L549-2true [2020-11-30 00:22:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-30 00:22:20,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:20,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097518735] [2020-11-30 00:22:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:20,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:20,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:20,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-11-30 00:22:20,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:20,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112687095] [2020-11-30 00:22:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:20,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112687095] [2020-11-30 00:22:20,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:20,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:22:20,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019919753] [2020-11-30 00:22:20,581 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:22:20,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:20,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 00:22:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 00:22:20,603 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2020-11-30 00:22:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:20,612 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2020-11-30 00:22:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 00:22:20,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2020-11-30 00:22:20,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-11-30 00:22:20,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2020-11-30 00:22:20,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-30 00:22:20,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-30 00:22:20,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2020-11-30 00:22:20,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:22:20,624 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-11-30 00:22:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2020-11-30 00:22:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-30 00:22:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-30 00:22:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2020-11-30 00:22:20,654 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-11-30 00:22:20,654 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-11-30 00:22:20,654 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:22:20,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2020-11-30 00:22:20,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-11-30 00:22:20,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:22:20,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:22:20,656 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:22:20,657 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:20,657 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11); 75#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, 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_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 63#L549-2 [2020-11-30 00:22:20,657 INFO L796 eck$LassoCheckResult]: Loop: 63#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 58#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 59#L538-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 60#L538-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 68#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L544 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.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 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, 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; 73#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 77#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 63#L549-2 [2020-11-30 00:22:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-30 00:22:20,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:20,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796496000] [2020-11-30 00:22:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:20,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:20,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:20,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-11-30 00:22:20,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:20,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517151560] [2020-11-30 00:22:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:20,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517151560] [2020-11-30 00:22:20,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:20,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:22:20,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315760472] [2020-11-30 00:22:20,896 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:22:20,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:20,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:22:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:20,897 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-11-30 00:22:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:21,137 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-11-30 00:22:21,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:22:21,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2020-11-30 00:22:21,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-11-30 00:22:21,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2020-11-30 00:22:21,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-30 00:22:21,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-11-30 00:22:21,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2020-11-30 00:22:21,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:22:21,144 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-11-30 00:22:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2020-11-30 00:22:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-11-30 00:22:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 00:22:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2020-11-30 00:22:21,150 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-11-30 00:22:21,150 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-11-30 00:22:21,150 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:22:21,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2020-11-30 00:22:21,153 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-11-30 00:22:21,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:22:21,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:22:21,153 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:22:21,154 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:21,154 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11); 135#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, 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_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 123#L549-2 [2020-11-30 00:22:21,154 INFO L796 eck$LassoCheckResult]: Loop: 123#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 117#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 118#L538-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 119#L538-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 128#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L544 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; 133#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 137#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 123#L549-2 [2020-11-30 00:22:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-30 00:22:21,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:21,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556253090] [2020-11-30 00:22:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,209 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-11-30 00:22:21,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:21,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062077306] [2020-11-30 00:22:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,276 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-11-30 00:22:21,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:21,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443925621] [2020-11-30 00:22:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:22:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:22:21,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443925621] [2020-11-30 00:22:21,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:22:21,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:22:21,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482103148] [2020-11-30 00:22:21,519 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-11-30 00:22:21,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:22:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:22:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:22:21,580 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-11-30 00:22:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:22:21,896 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2020-11-30 00:22:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:22:21,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2020-11-30 00:22:21,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2020-11-30 00:22:21,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2020-11-30 00:22:21,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-11-30 00:22:21,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-11-30 00:22:21,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2020-11-30 00:22:21,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:22:21,904 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-11-30 00:22:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2020-11-30 00:22:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2020-11-30 00:22:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 00:22:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-11-30 00:22:21,907 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-11-30 00:22:21,908 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-11-30 00:22:21,908 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:22:21,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2020-11-30 00:22:21,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2020-11-30 00:22:21,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:22:21,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:22:21,909 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:22:21,909 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:22:21,910 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(11); 214#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, 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_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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#L549-2 [2020-11-30 00:22:21,910 INFO L796 eck$LassoCheckResult]: Loop: 215#L549-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 195#L539-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 196#L538-1 assume !main_#t~short9; 197#L538-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 226#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L544 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; 223#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L549 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 215#L549-2 [2020-11-30 00:22:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-30 00:22:21,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:21,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744204324] [2020-11-30 00:22:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-11-30 00:22:21,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:21,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256749562] [2020-11-30 00:22:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:21,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:21,992 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:22:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-11-30 00:22:21,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:22:21,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653199057] [2020-11-30 00:22:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:22:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:22,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:22:22,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:22:22,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:22:22,180 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-11-30 00:22:22,658 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-11-30 00:22:22,707 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:22:22,830 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-30 00:22:22,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:22:22,833 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:22:22,834 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-11-30 00:22:22,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:22:22 BoogieIcfgContainer [2020-11-30 00:22:22,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:22:22,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:22:22,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:22:22,987 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:22:22,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:22:20" (3/4) ... [2020-11-30 00:22:22,991 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-30 00:22:23,030 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c130576d-395f-47d6-b053-f89f9cf162aa/bin/uautomizer/witness.graphml [2020-11-30 00:22:23,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:22:23,032 INFO L168 Benchmark]: Toolchain (without parser) took 4299.20 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 51.7 MB in the beginning and 36.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,033 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 86.0 MB. Free memory was 58.3 MB in the beginning and 58.3 MB in the end (delta: 23.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:22:23,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.62 ms. Allocated memory is still 86.0 MB. Free memory was 51.5 MB in the beginning and 49.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 86.0 MB. Free memory was 49.7 MB in the beginning and 47.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,036 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 86.0 MB. Free memory was 47.1 MB in the beginning and 45.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,037 INFO L168 Benchmark]: RCFGBuilder took 744.82 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 45.5 MB in the beginning and 69.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,038 INFO L168 Benchmark]: BuchiAutomizer took 2786.67 ms. Allocated memory is still 111.1 MB. Free memory was 69.4 MB in the beginning and 38.9 MB in the end (delta: 30.5 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,039 INFO L168 Benchmark]: Witness Printer took 43.99 ms. Allocated memory is still 111.1 MB. Free memory was 38.9 MB in the beginning and 36.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:22:23,044 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.95 ms. Allocated memory is still 86.0 MB. Free memory was 58.3 MB in the beginning and 58.3 MB in the end (delta: 23.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 608.62 ms. Allocated memory is still 86.0 MB. Free memory was 51.5 MB in the beginning and 49.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 86.0 MB. Free memory was 49.7 MB in the beginning and 47.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 86.0 MB. Free memory was 47.1 MB in the beginning and 45.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 744.82 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 45.5 MB in the beginning and 69.4 MB in the end (delta: -23.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2786.67 ms. Allocated memory is still 111.1 MB. Free memory was 69.4 MB in the beginning and 38.9 MB in the end (delta: 30.5 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. * Witness Printer took 43.99 ms. Allocated memory is still 111.1 MB. Free memory was 38.9 MB in the beginning and 36.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1316} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7387dfd6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bc54a8c=0, NULL=1318, NULL=1316, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@713be689=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36e41c87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2deff2d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ff36a99=0, root=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@21e63173=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@664cebcf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7387dfd6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@594399f1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36a2eb9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24eab01f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e379d8b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f2ca262=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@664cebcf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26410e4b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@544af213=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39192db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@544af213=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2deff2d7=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@21e63173=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6524011d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@713be689=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@778a0f8c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16dfc5da=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23bb10fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43ac397e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39192db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e85c35d=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d2c8e42=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6524011d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36e41c87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@567768e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7baac04d=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16dfc5da=0, n=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7baac04d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51eaaa4b=28, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@778a0f8c=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bc54a8c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@36a2eb9=0, sentinel=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ff36a99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72515e00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43ac397e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d2c8e42=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2ca4b71a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@567768e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72515e00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26410e4b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e379d8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5073541e=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e85c35d=0, pred=0, s=0, NULL=1317, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5073541e=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23bb10fa=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...