./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.1-dev-20ed64e [2021-08-27 17:39:56,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:39:56,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:39:56,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:39:56,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:39:56,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:39:56,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:39:56,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:39:56,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:39:56,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:39:56,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:39:56,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:39:56,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:39:56,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:39:56,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:39:56,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:39:56,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:39:56,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:39:56,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:39:56,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:39:56,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:39:56,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:39:56,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:39:56,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:39:56,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:39:56,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:39:56,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:39:56,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:39:56,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:39:56,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:39:56,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:39:56,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:39:56,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:39:56,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:39:56,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:39:56,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:39:56,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:39:56,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:39:56,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:39:56,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:39:56,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:39:56,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:39:56,394 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:39:56,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:39:56,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:39:56,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:39:56,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:39:56,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:39:56,397 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:39:56,397 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:39:56,397 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:39:56,398 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:39:56,398 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:39:56,399 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:39:56,399 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:39:56,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:39:56,399 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:39:56,399 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:39:56,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:39:56,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:39:56,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:39:56,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:39:56,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:39:56,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:39:56,401 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:39:56,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:39:56,401 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:39:56,401 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:39:56,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:39:56,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:39:56,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:39:56,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:39:56,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:39:56,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:39:56,404 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:39:56,404 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0046771f7e99737dcb98805b185666cbe0afcb5f [2021-08-27 17:39:56,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:39:56,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:39:56,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:39:56,749 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:39:56,749 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:39:56,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2021-08-27 17:39:56,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55c4391e/8ad43ca79bda4bb7bd5bfa15c86283de/FLAGb178c5f4b [2021-08-27 17:39:57,329 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:39:57,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2021-08-27 17:39:57,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55c4391e/8ad43ca79bda4bb7bd5bfa15c86283de/FLAGb178c5f4b [2021-08-27 17:39:57,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55c4391e/8ad43ca79bda4bb7bd5bfa15c86283de [2021-08-27 17:39:57,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:39:57,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:39:57,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:39:57,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:39:57,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:39:57,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cb76f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:57, skipping insertion in model container [2021-08-27 17:39:57,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:39:57" (1/1) ... [2021-08-27 17:39:57,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:39:57,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:39:58,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:39:58,139 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:39:58,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:39:58,209 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:39:58,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58 WrapperNode [2021-08-27 17:39:58,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:39:58,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:39:58,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:39:58,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:39:58,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:39:58,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:39:58,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:39:58,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:39:58,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:39:58,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:39:58,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:39:58,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:39:58,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (1/1) ... [2021-08-27 17:39:58,327 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:39:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:39:58,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:39:58,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:39:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:39:58,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:39:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:39:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:39:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:39:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:39:58,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:39:58,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:39:58,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:39:58,940 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 17:39:58,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:58 BoogieIcfgContainer [2021-08-27 17:39:58,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:39:58,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:39:58,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:39:58,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:39:58,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:58,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:39:57" (1/3) ... [2021-08-27 17:39:58,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b7df608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:39:58, skipping insertion in model container [2021-08-27 17:39:58,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:58,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:39:58" (2/3) ... [2021-08-27 17:39:58,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b7df608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:39:58, skipping insertion in model container [2021-08-27 17:39:58,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:39:58,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:58" (3/3) ... [2021-08-27 17:39:58,951 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2021-08-27 17:39:58,995 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:39:58,995 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:39:58,995 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:39:58,996 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:39:58,996 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:39:58,996 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:39:58,996 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:39:58,996 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:39:59,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:39:59,030 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-27 17:39:59,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:59,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:59,035 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:59,036 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:39:59,036 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:39:59,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:39:59,041 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-27 17:39:59,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:59,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:59,042 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:59,042 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:39:59,047 INFO L791 eck$LassoCheckResult]: Stem: 15#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_#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); 21#L549-2true [2021-08-27 17:39:59,047 INFO L793 eck$LassoCheckResult]: Loop: 21#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; 12#L539-2true assume !true; 18#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);havoc main_#t~malloc15.base, main_#t~malloc15.offset;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; 5#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 11#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; 21#L549-2true [2021-08-27 17:39:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:39:59,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863174025] [2021-08-27 17:39:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,162 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,217 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-08-27 17:39:59,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727665810] [2021-08-27 17:39:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:39:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:39:59,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:39:59,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727665810] [2021-08-27 17:39:59,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727665810] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:39:59,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:39:59,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 17:39:59,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493093963] [2021-08-27 17:39:59,264 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:39:59,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:39:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 17:39:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 17:39:59,278 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:39:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:39:59,284 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2021-08-27 17:39:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 17:39:59,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2021-08-27 17:39:59,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-27 17:39:59,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2021-08-27 17:39:59,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-08-27 17:39:59,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-08-27 17:39:59,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2021-08-27 17:39:59,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:39:59,292 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-08-27 17:39:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2021-08-27 17:39:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-08-27 17:39:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:39:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2021-08-27 17:39:59,310 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-08-27 17:39:59,310 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-08-27 17:39:59,310 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:39:59,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2021-08-27 17:39:59,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-27 17:39:59,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:59,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:59,311 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:59,311 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:39:59,312 INFO L791 eck$LassoCheckResult]: Stem: 64#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); 65#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_#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); 70#L549-2 [2021-08-27 17:39:59,312 INFO L793 eck$LassoCheckResult]: Loop: 70#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; 63#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; 71#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; 58#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 59#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 69#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);havoc main_#t~malloc15.base, main_#t~malloc15.offset;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; 66#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 67#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; 70#L549-2 [2021-08-27 17:39:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 17:39:59,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913285475] [2021-08-27 17:39:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,327 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,344 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-08-27 17:39:59,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810653755] [2021-08-27 17:39:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:39:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:39:59,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:39:59,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810653755] [2021-08-27 17:39:59,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810653755] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:39:59,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:39:59,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:39:59,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620562839] [2021-08-27 17:39:59,477 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:39:59,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:39:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:39:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:39:59,478 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:39:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:39:59,621 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2021-08-27 17:39:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:39:59,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2021-08-27 17:39:59,627 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2021-08-27 17:39:59,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2021-08-27 17:39:59,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 17:39:59,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-27 17:39:59,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2021-08-27 17:39:59,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:39:59,631 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2021-08-27 17:39:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2021-08-27 17:39:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-08-27 17:39:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:39:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2021-08-27 17:39:59,635 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-08-27 17:39:59,635 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-08-27 17:39:59,635 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:39:59,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2021-08-27 17:39:59,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-08-27 17:39:59,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:39:59,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:39:59,640 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:39:59,640 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:39:59,640 INFO L791 eck$LassoCheckResult]: Stem: 123#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); 124#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_#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); 129#L549-2 [2021-08-27 17:39:59,641 INFO L793 eck$LassoCheckResult]: Loop: 129#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; 122#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; 130#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; 131#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 140#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 128#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; 125#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 126#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; 129#L549-2 [2021-08-27 17:39:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,642 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 17:39:59,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211459436] [2021-08-27 17:39:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,670 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,697 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-08-27 17:39:59,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024374725] [2021-08-27 17:39:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,719 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:39:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:39:59,739 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:39:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:39:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-08-27 17:39:59,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:39:59,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832243318] [2021-08-27 17:39:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:39:59,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:39:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:39:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:39:59,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:39:59,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832243318] [2021-08-27 17:39:59,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832243318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:39:59,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:39:59,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:39:59,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734896389] [2021-08-27 17:40:00,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:40:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:40:00,112 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:00,297 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2021-08-27 17:40:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:40:00,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2021-08-27 17:40:00,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2021-08-27 17:40:00,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2021-08-27 17:40:00,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-08-27 17:40:00,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-08-27 17:40:00,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2021-08-27 17:40:00,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:00,300 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2021-08-27 17:40:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2021-08-27 17:40:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-08-27 17:40:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-08-27 17:40:00,303 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-08-27 17:40:00,304 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-08-27 17:40:00,304 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:40:00,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2021-08-27 17:40:00,304 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2021-08-27 17:40:00,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:00,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:00,305 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:00,305 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:00,305 INFO L791 eck$LassoCheckResult]: Stem: 201#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); 202#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_#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); 208#L549-2 [2021-08-27 17:40:00,306 INFO L793 eck$LassoCheckResult]: Loop: 208#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; 217#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; 209#L538-1 assume !main_#t~short9; 210#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 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; 203#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 204#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; 208#L549-2 [2021-08-27 17:40:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 17:40:00,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019235363] [2021-08-27 17:40:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,316 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,324 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-08-27 17:40:00,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734186981] [2021-08-27 17:40:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,331 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,337 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-08-27 17:40:00,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:00,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274078101] [2021-08-27 17:40:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:00,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,349 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:00,361 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:01,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:40:01 BoogieIcfgContainer [2021-08-27 17:40:01,015 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:40:01,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:40:01,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:40:01,016 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:40:01,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:39:58" (3/4) ... [2021-08-27 17:40:01,018 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 17:40:01,043 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 17:40:01,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:40:01,045 INFO L168 Benchmark]: Toolchain (without parser) took 3228.13 ms. Allocated memory was 56.6 MB in the beginning and 107.0 MB in the end (delta: 50.3 MB). Free memory was 34.2 MB in the beginning and 83.3 MB in the end (delta: -49.2 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,045 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 38.8 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:40:01,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.42 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 34.0 MB in the beginning and 50.1 MB in the end (delta: -16.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.70 ms. Allocated memory is still 73.4 MB. Free memory was 49.9 MB in the beginning and 47.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,047 INFO L168 Benchmark]: Boogie Preprocessor took 41.68 ms. Allocated memory is still 73.4 MB. Free memory was 47.7 MB in the beginning and 45.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,047 INFO L168 Benchmark]: RCFGBuilder took 631.48 ms. Allocated memory is still 73.4 MB. Free memory was 45.9 MB in the beginning and 49.5 MB in the end (delta: -3.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,048 INFO L168 Benchmark]: BuchiAutomizer took 2071.17 ms. Allocated memory was 73.4 MB in the beginning and 107.0 MB in the end (delta: 33.6 MB). Free memory was 49.2 MB in the beginning and 84.5 MB in the end (delta: -35.3 MB). Peak memory consumption was 43.2 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,049 INFO L168 Benchmark]: Witness Printer took 28.24 ms. Allocated memory is still 107.0 MB. Free memory was 84.5 MB in the beginning and 83.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:01,052 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.18 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 38.8 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 383.42 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 34.0 MB in the beginning and 50.1 MB in the end (delta: -16.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.70 ms. Allocated memory is still 73.4 MB. Free memory was 49.9 MB in the beginning and 47.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.68 ms. Allocated memory is still 73.4 MB. Free memory was 47.7 MB in the beginning and 45.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 631.48 ms. Allocated memory is still 73.4 MB. Free memory was 45.9 MB in the beginning and 49.5 MB in the end (delta: -3.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2071.17 ms. Allocated memory was 73.4 MB in the beginning and 107.0 MB in the end (delta: 33.6 MB). Free memory was 49.2 MB in the beginning and 84.5 MB in the end (delta: -35.3 MB). Peak memory consumption was 43.2 MB. Max. memory is 16.1 GB. * Witness Printer took 28.24 ms. Allocated memory is still 107.0 MB. Free memory was 84.5 MB in the beginning and 83.3 MB in the end (delta: 1.2 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.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 15.2ms 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, 29 SDslu, 82 SDs, 0 SdLazy, 147 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 213.8ms 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=23101} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9e81730=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@121f9fd0=0, NULL=23102, NULL=23101, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67377f91=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31420bd9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66501132=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bb817dc=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cd92228=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@270f3f70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9e81730=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6698c86c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7087117f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@699240ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e79df9b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13b0b233=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@270f3f70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@268e5be3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43040d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367bf5ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43040d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66501132=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cd92228=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b3abfe5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67377f91=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26cb98ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@775a79be=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7007fac3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@11ce2674=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367bf5ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31366bba=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@530cad2a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b3abfe5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31420bd9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7aa28ca3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22d3f178=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@775a79be=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22d3f178=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@649e989a=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26cb98ef=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@121f9fd0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7087117f=0, sentinel=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7bb817dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f31e5b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@11ce2674=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@530cad2a=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4fc8b1ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7aa28ca3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f31e5b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@268e5be3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e79df9b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14d7860a=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31366bba=0, pred=0, s=0, NULL=23103, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14d7860a=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7007fac3=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; [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! [2021-08-27 17:40:01,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...