./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.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_stack.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 a0142cb115f7d1e16772bca3adcba9f1aba5ac12 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:40:01,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:40:01,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:40:01,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:40:01,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:40:01,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:40:01,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:40:01,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:40:01,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:40:01,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:40:01,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:40:01,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:40:01,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:40:01,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:40:01,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:40:01,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:40:01,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:40:01,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:40:01,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:40:01,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:40:01,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:40:01,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:40:01,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:40:01,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:40:01,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:40:01,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:40:01,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:40:01,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:40:01,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:40:01,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:40:01,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:40:01,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:40:01,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:40:01,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:40:01,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:40:01,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:40:01,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:40:01,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:40:01,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:40:01,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:40:01,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:40:01,991 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:40:02,019 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:40:02,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:40:02,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:40:02,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:40:02,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:40:02,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:40:02,022 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:40:02,023 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:40:02,023 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:40:02,023 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:40:02,023 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:40:02,024 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:40:02,024 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:40:02,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:40:02,024 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:40:02,024 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:40:02,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:40:02,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:40:02,025 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:40:02,026 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:40:02,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:40:02,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:40:02,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:40:02,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:40:02,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:40:02,027 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:40:02,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:40:02,028 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 -> a0142cb115f7d1e16772bca3adcba9f1aba5ac12 [2021-08-27 17:40:02,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:40:02,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:40:02,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:40:02,292 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:40:02,292 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:40:02,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-08-27 17:40:02,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65725abc0/676b075f7ee04c1b9061f34539ff0328/FLAG33b2dc5d3 [2021-08-27 17:40:02,749 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:40:02,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-08-27 17:40:02,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65725abc0/676b075f7ee04c1b9061f34539ff0328/FLAG33b2dc5d3 [2021-08-27 17:40:03,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65725abc0/676b075f7ee04c1b9061f34539ff0328 [2021-08-27 17:40:03,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:40:03,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:40:03,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:40:03,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:40:03,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:40:03,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67164e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03, skipping insertion in model container [2021-08-27 17:40:03,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:40:03,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:40:03,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:40:03,381 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:40:03,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:40:03,428 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:40:03,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03 WrapperNode [2021-08-27 17:40:03,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:40:03,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:40:03,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:40:03,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:40:03,434 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:40:03" (1/1) ... [2021-08-27 17:40:03,442 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:40:03" (1/1) ... [2021-08-27 17:40:03,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:40:03,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:40:03,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:40:03,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:40:03,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:40:03,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:40:03,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:40:03,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:40:03,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (1/1) ... [2021-08-27 17:40:03,486 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:03,499 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:40:03,507 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:40:03,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:40:03,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:40:03,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:40:03,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:40:03,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:40:03,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:40:03,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:40:03,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:40:03,936 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:40:03,938 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-27 17:40:03,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:03 BoogieIcfgContainer [2021-08-27 17:40:03,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:40:03,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:40:03,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:40:03,943 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:40:03,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:03,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:40:03" (1/3) ... [2021-08-27 17:40:03,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@227393a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:40:03, skipping insertion in model container [2021-08-27 17:40:03,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:03,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:03" (2/3) ... [2021-08-27 17:40:03,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@227393a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:40:03, skipping insertion in model container [2021-08-27 17:40:03,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:03,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:03" (3/3) ... [2021-08-27 17:40:03,946 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2021-08-27 17:40:03,983 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:40:03,983 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:40:03,983 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:40:03,983 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:40:03,983 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:40:03,983 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:40:03,984 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:40:03,984 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:40:03,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) 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:40:04,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:04,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:04,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:04,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:04,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:40:04,017 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:40:04,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) 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:40:04,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:04,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:04,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:04,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:04,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:40:04,025 INFO L791 eck$LassoCheckResult]: Stem: 6#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(13); 12#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~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); 16#L549-2true [2021-08-27 17:40:04,026 INFO L793 eck$LassoCheckResult]: Loop: 16#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; 21#L539-2true assume !true; 14#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 10#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; 7#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 20#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; 16#L549-2true [2021-08-27 17:40:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:40:04,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19899500] [2021-08-27 17:40:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,119 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,169 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-08-27 17:40:04,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692677846] [2021-08-27 17:40:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:04,231 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:40:04,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:04,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692677846] [2021-08-27 17:40:04,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692677846] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:04,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:04,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 17:40:04,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257575301] [2021-08-27 17:40:04,239 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:40:04,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:04,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 17:40:04,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 17:40:04,257 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) 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) 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:40:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:04,263 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-08-27 17:40:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 17:40:04,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-08-27 17:40:04,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:04,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-08-27 17:40:04,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:40:04,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:40:04,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-08-27 17:40:04,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:04,274 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:40:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-08-27 17:40:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-08-27 17:40:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-08-27 17:40:04,291 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:40:04,291 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:40:04,291 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:40:04,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-08-27 17:40:04,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-08-27 17:40:04,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:04,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:04,294 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:04,294 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:04,294 INFO L791 eck$LassoCheckResult]: Stem: 56#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(13); 57#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~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); 63#L549-2 [2021-08-27 17:40:04,295 INFO L793 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; 53#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; 64#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; 50#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; 51#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 62#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; 54#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 55#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 [2021-08-27 17:40:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 17:40:04,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634381429] [2021-08-27 17:40:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,322 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,343 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-08-27 17:40:04,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3685211] [2021-08-27 17:40:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:04,450 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:40:04,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:04,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3685211] [2021-08-27 17:40:04,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3685211] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:04,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:04,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:40:04,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705805493] [2021-08-27 17:40:04,463 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:40:04,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:40:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:40:04,468 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 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:40:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:04,550 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-08-27 17:40:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:40:04,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-08-27 17:40:04,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-08-27 17:40:04,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-08-27 17:40:04,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 17:40:04,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 17:40:04,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-08-27 17:40:04,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:04,553 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-08-27 17:40:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-08-27 17:40:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-08-27 17:40:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-08-27 17:40:04,555 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-08-27 17:40:04,555 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-08-27 17:40:04,555 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:40:04,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-08-27 17:40:04,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-08-27 17:40:04,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:04,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:04,556 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:04,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:04,556 INFO L791 eck$LassoCheckResult]: Stem: 107#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(13); 108#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~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); 114#L549-2 [2021-08-27 17:40:04,556 INFO L793 eck$LassoCheckResult]: Loop: 114#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; 104#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; 115#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; 116#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; 120#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 113#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; 105#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 106#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; 114#L549-2 [2021-08-27 17:40:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 17:40:04,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110335384] [2021-08-27 17:40:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,564 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,571 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-08-27 17:40:04,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641983151] [2021-08-27 17:40:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,577 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,582 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-08-27 17:40:04,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198974032] [2021-08-27 17:40:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:04,644 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:40:04,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:04,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198974032] [2021-08-27 17:40:04,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198974032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:04,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:04,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:40:04,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068555663] [2021-08-27 17:40:04,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:40:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:40:04,835 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 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:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:04,945 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-08-27 17:40:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:40:04,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-08-27 17:40:04,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-08-27 17:40:04,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-08-27 17:40:04,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-08-27 17:40:04,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-08-27 17:40:04,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-08-27 17:40:04,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:04,947 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-08-27 17:40:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-08-27 17:40:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-08-27 17:40:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 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:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-08-27 17:40:04,949 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-08-27 17:40:04,949 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-08-27 17:40:04,949 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:40:04,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-08-27 17:40:04,950 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-08-27 17:40:04,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:04,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:04,950 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:40:04,950 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:04,950 INFO L791 eck$LassoCheckResult]: Stem: 172#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(13); 173#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~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); 181#L549-2 [2021-08-27 17:40:04,950 INFO L793 eck$LassoCheckResult]: Loop: 181#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; 185#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; 182#L538-1 assume !main_#t~short9; 183#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; 194#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#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; 192#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 191#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; 181#L549-2 [2021-08-27 17:40:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 17:40:04,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997176223] [2021-08-27 17:40:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,959 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,972 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-08-27 17:40:04,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971075645] [2021-08-27 17:40:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:04,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,989 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:04,997 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-08-27 17:40:04,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:04,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680764984] [2021-08-27 17:40:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:05,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:05,012 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:05,032 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:05,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:40:05 BoogieIcfgContainer [2021-08-27 17:40:05,532 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:40:05,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:40:05,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:40:05,532 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:40:05,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:03" (3/4) ... [2021-08-27 17:40:05,534 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 17:40:05,552 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 17:40:05,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:40:05,553 INFO L168 Benchmark]: Toolchain (without parser) took 2425.41 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 31.1 MB in the beginning and 53.4 MB in the end (delta: -22.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:05,554 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 35.8 MB in the beginning and 35.7 MB in the end (delta: 29.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:40:05,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.19 ms. Allocated memory is still 54.5 MB. Free memory was 30.8 MB in the beginning and 30.4 MB in the end (delta: 484.7 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:05,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.78 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 28.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:05,555 INFO L168 Benchmark]: Boogie Preprocessor took 22.22 ms. Allocated memory is still 54.5 MB. Free memory was 28.2 MB in the beginning and 26.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:05,555 INFO L168 Benchmark]: RCFGBuilder took 458.45 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 26.4 MB in the beginning and 43.5 MB in the end (delta: -17.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:05,556 INFO L168 Benchmark]: BuchiAutomizer took 1591.13 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 43.5 MB in the beginning and 54.3 MB in the end (delta: -10.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:40:05,556 INFO L168 Benchmark]: Witness Printer took 20.72 ms. Allocated memory is still 98.6 MB. Free memory was 54.3 MB in the beginning and 53.4 MB in the end (delta: 908.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:40:05,558 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.15 ms. Allocated memory is still 54.5 MB. Free memory was 35.8 MB in the beginning and 35.7 MB in the end (delta: 29.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.19 ms. Allocated memory is still 54.5 MB. Free memory was 30.8 MB in the beginning and 30.4 MB in the end (delta: 484.7 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.78 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 28.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.22 ms. Allocated memory is still 54.5 MB. Free memory was 28.2 MB in the beginning and 26.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 458.45 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 26.4 MB in the beginning and 43.5 MB in the end (delta: -17.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1591.13 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 43.5 MB in the beginning and 54.3 MB in the end (delta: -10.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 16.1 GB. * Witness Printer took 20.72 ms. Allocated memory is still 98.6 MB. Free memory was 54.3 MB in the beginning and 53.4 MB in the end (delta: 908.8 kB). There was no memory consumed. 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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 12.1ms AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 132.2ms 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=5609} State at position 1 is {s=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@144b32f6=0, NULL=5610, NULL=5609, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@279b190=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@14d38dee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a3efd76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@520271c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@483772b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a86fd52=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52c2c5ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17d9f75e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@14d38dee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f964c18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68b5e2a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65417714=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55d49e41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17d9f75e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f8a8dc9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f1bcf6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f8a8dc9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@520271c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52c2c5ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a86fd52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@279b190=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@588c690a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@292b7558=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6479b7cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f1bcf6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@593993b3=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a668c18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@329c893a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a3efd76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e1ee626=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24e44be8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@588c690a=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24e44be8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1493362e=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30d3edb9=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@144b32f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68b5e2a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@483772b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6479b7cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@329c893a=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@14872565=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e1ee626=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d3de047=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a668c18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30d3edb9=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@593993b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d3de047=0, s=0, NULL=5611, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@292b7558=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:05,600 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...