./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 6c24879c 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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:54:29,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:54:29,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:54:29,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:54:29,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:54:29,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:54:29,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:54:29,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:54:29,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:54:29,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:54:29,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:54:29,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:54:29,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:54:29,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:54:29,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:54:29,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:54:29,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:54:29,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:54:29,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:54:29,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:54:29,337 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:54:29,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:54:29,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:54:29,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:54:29,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:54:29,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:54:29,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:54:29,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:54:29,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:54:29,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:54:29,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:54:29,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:54:29,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:54:29,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:54:29,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:54:29,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:54:29,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:54:29,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:54:29,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:54:29,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:54:29,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:54:29,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:54:29,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:54:29,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:54:29,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:54:29,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:54:29,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:54:29,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:54:29,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:54:29,382 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:54:29,382 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:54:29,382 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:54:29,382 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:54:29,382 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:54:29,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:54:29,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:54:29,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:54:29,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:54:29,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:54:29,385 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:54:29,385 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2022-07-13 04:54:29,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:54:29,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:54:29,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:54:29,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:54:29,610 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:54:29,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-07-13 04:54:29,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5532f4a1c/46e5009e33c74592a3875c9d6dcba5d2/FLAG7e5fda519 [2022-07-13 04:54:30,082 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:54:30,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-07-13 04:54:30,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5532f4a1c/46e5009e33c74592a3875c9d6dcba5d2/FLAG7e5fda519 [2022-07-13 04:54:30,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5532f4a1c/46e5009e33c74592a3875c9d6dcba5d2 [2022-07-13 04:54:30,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:54:30,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:54:30,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:30,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:54:30,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:54:30,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277a6d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30, skipping insertion in model container [2022-07-13 04:54:30,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:54:30,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:54:30,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:30,380 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:54:30,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:30,431 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:54:30,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30 WrapperNode [2022-07-13 04:54:30,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:30,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:30,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:54:30,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:54:30,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,468 INFO L137 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-07-13 04:54:30,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:30,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:54:30,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:54:30,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:54:30,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:54:30,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:54:30,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:54:30,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:54:30,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (1/1) ... [2022-07-13 04:54:30,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:30,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:30,537 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) [2022-07-13 04:54:30,539 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 [2022-07-13 04:54:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 04:54:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:54:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 04:54:30,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 04:54:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:54:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:54:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:54:30,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:54:30,650 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:54:30,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:54:30,918 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:54:30,927 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:54:30,928 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 04:54:30,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:30 BoogieIcfgContainer [2022-07-13 04:54:30,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:54:30,933 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:54:30,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:54:30,937 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:54:30,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:30,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:54:30" (1/3) ... [2022-07-13 04:54:30,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@419264f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:30, skipping insertion in model container [2022-07-13 04:54:30,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:30,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:30" (2/3) ... [2022-07-13 04:54:30,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@419264f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:30, skipping insertion in model container [2022-07-13 04:54:30,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:30,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:30" (3/3) ... [2022-07-13 04:54:30,941 INFO L354 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2022-07-13 04:54:30,989 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:54:30,990 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:54:30,990 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:54:30,990 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:54:30,990 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:54:30,990 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:54:30,991 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:54:30,991 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:54:30,997 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) [2022-07-13 04:54:31,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-13 04:54:31,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:31,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:31,017 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:31,017 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:54:31,017 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:54:31,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) [2022-07-13 04:54:31,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-13 04:54:31,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:31,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:31,020 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:31,020 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:54:31,024 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 15#L549-2true [2022-07-13 04:54:31,025 INFO L754 eck$LassoCheckResult]: Loop: 15#L549-2true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 20#L539-2true assume !true; 13#L538-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 9#L544true assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 6#L544-2true call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 19#L549true assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 15#L549-2true [2022-07-13 04:54:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 04:54:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758003825] [2022-07-13 04:54:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-07-13 04:54:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490080108] [2022-07-13 04:54:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:31,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490080108] [2022-07-13 04:54:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490080108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:54:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163461697] [2022-07-13 04:54:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:31,278 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:54:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 04:54:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 04:54:31,308 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) [2022-07-13 04:54:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:31,314 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-07-13 04:54:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 04:54:31,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2022-07-13 04:54:31,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-13 04:54:31,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2022-07-13 04:54:31,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:54:31,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:54:31,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2022-07-13 04:54:31,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:31,328 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-13 04:54:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2022-07-13 04:54:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 04:54:31,346 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) [2022-07-13 04:54:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-07-13 04:54:31,348 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-13 04:54:31,348 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-13 04:54:31,348 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:54:31,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-07-13 04:54:31,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-13 04:54:31,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:31,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:31,351 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:31,351 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:31,351 INFO L752 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 63#L549-2 [2022-07-13 04:54:31,351 INFO L754 eck$LassoCheckResult]: Loop: 63#L549-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 53#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 64#L538-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 50#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 51#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 62#L544 assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 54#L544-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 55#L549 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 63#L549-2 [2022-07-13 04:54:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 04:54:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493711404] [2022-07-13 04:54:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-07-13 04:54:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222681961] [2022-07-13 04:54:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:31,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222681961] [2022-07-13 04:54:31,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222681961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:31,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:31,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:54:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025662194] [2022-07-13 04:54:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:31,555 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:54:31,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:31,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:31,556 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) [2022-07-13 04:54:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:31,648 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-07-13 04:54:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:54:31,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-07-13 04:54:31,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-07-13 04:54:31,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2022-07-13 04:54:31,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-13 04:54:31,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-13 04:54:31,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2022-07-13 04:54:31,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:31,663 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-07-13 04:54:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2022-07-13 04:54:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-13 04:54:31,666 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) [2022-07-13 04:54:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-07-13 04:54:31,667 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-13 04:54:31,667 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-13 04:54:31,668 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:54:31,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-07-13 04:54:31,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:54:31,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:31,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:31,670 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:31,670 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:31,670 INFO L752 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 114#L549-2 [2022-07-13 04:54:31,670 INFO L754 eck$LassoCheckResult]: Loop: 114#L549-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 104#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 115#L538-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 116#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 120#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 113#L544 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 105#L544-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 106#L549 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 114#L549-2 [2022-07-13 04:54:31,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 04:54:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461133471] [2022-07-13 04:54:31,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-07-13 04:54:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82656022] [2022-07-13 04:54:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:31,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-07-13 04:54:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:31,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67520023] [2022-07-13 04:54:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:31,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67520023] [2022-07-13 04:54:31,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67520023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:31,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:31,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:54:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612388260] [2022-07-13 04:54:31,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:31,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:31,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:31,977 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) [2022-07-13 04:54:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:32,113 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-07-13 04:54:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:54:32,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2022-07-13 04:54:32,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-07-13 04:54:32,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2022-07-13 04:54:32,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-13 04:54:32,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-13 04:54:32,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2022-07-13 04:54:32,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:32,115 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-07-13 04:54:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2022-07-13 04:54:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-13 04:54:32,117 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) [2022-07-13 04:54:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-07-13 04:54:32,117 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-07-13 04:54:32,117 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-07-13 04:54:32,117 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:54:32,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2022-07-13 04:54:32,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-07-13 04:54:32,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:32,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:32,118 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:32,118 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:32,118 INFO L752 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 173#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 181#L549-2 [2022-07-13 04:54:32,118 INFO L754 eck$LassoCheckResult]: Loop: 181#L549-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 185#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 182#L538-1 assume !main_#t~short7#1; 183#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 194#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 193#L544 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 192#L544-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 191#L549 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 181#L549-2 [2022-07-13 04:54:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 04:54:32,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:32,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145704422] [2022-07-13 04:54:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:32,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:32,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-07-13 04:54:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:32,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254738835] [2022-07-13 04:54:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:32,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:32,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:32,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-07-13 04:54:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:32,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465463982] [2022-07-13 04:54:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:32,174 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:32,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:32,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:54:32 BoogieIcfgContainer [2022-07-13 04:54:32,619 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:54:32,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:54:32,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:54:32,620 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:54:32,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:30" (3/4) ... [2022-07-13 04:54:32,622 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 04:54:32,659 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 04:54:32,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:54:32,660 INFO L158 Benchmark]: Toolchain (without parser) took 2544.70ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 71.5MB in the beginning and 101.9MB in the end (delta: -30.4MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,661 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 56.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:32,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.01ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 76.0MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.18ms. Allocated memory is still 107.0MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,662 INFO L158 Benchmark]: Boogie Preprocessor took 35.70ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 71.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,662 INFO L158 Benchmark]: RCFGBuilder took 427.10ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 50.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,663 INFO L158 Benchmark]: BuchiAutomizer took 1686.36ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 50.8MB in the beginning and 104.0MB in the end (delta: -53.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,663 INFO L158 Benchmark]: Witness Printer took 39.71ms. Allocated memory is still 157.3MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:32,666 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.11ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 56.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.01ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 76.0MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.18ms. Allocated memory is still 107.0MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.70ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 71.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.10ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 50.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 1686.36ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 50.8MB in the beginning and 104.0MB in the end (delta: -53.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 39.71ms. Allocated memory is still 157.3MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. 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 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 68 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown 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 InitialAbstractionConstructionTime: 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=1} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f9ea2ef=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63564a56=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@157c98c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@505a0c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@447ce7e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@157c98c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d854d05=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a1b4979=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@259c0d6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16501156=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@d878528=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47c018f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c254e5a=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a1b4979=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67437d66=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@505a0c0=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16501156=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e602edd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d8e5bd2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b57774f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ddbda34=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d8e5bd2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ab9926b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@259c0d6e=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@21171717=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2e25de58=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e19097=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57bf1f9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f9ea2ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e19097=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57bf1f9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47c018f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@447ce7e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16e92bfa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@584b2e87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@d878528=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67437d66=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ddbda34=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63564a56=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ab9926b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c254e5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b57774f=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@320b325a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@21171717=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a764a2b=9, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@584b2e87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d854d05=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@470bafe3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16e92bfa=0, s=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! [2022-07-13 04:54:32,718 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)