./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 f4b24e32 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-?-f4b24e3 [2022-07-14 16:34:12,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:34:12,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:34:12,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:34:12,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:34:12,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:34:12,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:34:12,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:34:12,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:34:12,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:34:12,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:34:12,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:34:12,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:34:12,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:34:12,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:34:12,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:34:12,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:34:12,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:34:12,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:34:12,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:34:12,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:34:12,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:34:12,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:34:12,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:34:12,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:34:12,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:34:12,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:34:12,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:34:12,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:34:12,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:34:12,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:34:12,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:34:12,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:34:12,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:34:12,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:34:12,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:34:12,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:34:12,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:34:12,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:34:12,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:34:12,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:34:12,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:34:12,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:34:12,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:34:12,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:34:12,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:34:12,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:34:12,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:34:12,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:34:12,949 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:34:12,949 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:34:12,949 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:34:12,950 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:34:12,950 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:34:12,950 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:34:12,950 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:34:12,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:34:12,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:34:12,951 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:34:12,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:34:12,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:34:12,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:34:12,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:34:12,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:34:12,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:34:12,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:34:12,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:34:12,952 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:34:12,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:34:12,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:34:12,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:34:12,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:34:12,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:34:12,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:34:12,955 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:34:12,956 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-14 16:34:13,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:34:13,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:34:13,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:34:13,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:34:13,224 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:34:13,225 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-14 16:34:13,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59190b39/6fb541312634479bb91888e7e6673d9a/FLAGe3c4521e9 [2022-07-14 16:34:13,826 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:34:13,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-07-14 16:34:13,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59190b39/6fb541312634479bb91888e7e6673d9a/FLAGe3c4521e9 [2022-07-14 16:34:14,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59190b39/6fb541312634479bb91888e7e6673d9a [2022-07-14 16:34:14,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:34:14,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:34:14,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:34:14,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:34:14,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:34:14,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ba261f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14, skipping insertion in model container [2022-07-14 16:34:14,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:34:14,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:34:14,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:34:14,657 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:34:14,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:34:14,721 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:34:14,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14 WrapperNode [2022-07-14 16:34:14,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:34:14,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:34:14,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:34:14,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:34:14,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,797 INFO L137 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-07-14 16:34:14,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:34:14,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:34:14,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:34:14,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:34:14,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:34:14,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:34:14,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:34:14,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:34:14,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (1/1) ... [2022-07-14 16:34:14,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:34:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:34:14,893 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-14 16:34:14,918 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-14 16:34:14,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 16:34:14,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:34:14,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 16:34:14,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 16:34:14,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 16:34:14,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:34:14,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:34:14,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:34:15,103 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:34:15,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:34:15,407 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:34:15,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:34:15,413 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 16:34:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:34:15 BoogieIcfgContainer [2022-07-14 16:34:15,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:34:15,416 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:34:15,416 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:34:15,419 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:34:15,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:34:15,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:34:14" (1/3) ... [2022-07-14 16:34:15,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2112785a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:34:15, skipping insertion in model container [2022-07-14 16:34:15,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:34:15,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:34:14" (2/3) ... [2022-07-14 16:34:15,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2112785a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:34:15, skipping insertion in model container [2022-07-14 16:34:15,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:34:15,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:34:15" (3/3) ... [2022-07-14 16:34:15,422 INFO L354 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2022-07-14 16:34:15,472 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:34:15,473 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:34:15,473 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:34:15,473 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:34:15,473 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:34:15,473 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:34:15,473 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:34:15,474 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:34:15,482 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-14 16:34:15,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-14 16:34:15,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:34:15,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:34:15,507 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:34:15,507 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 16:34:15,508 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:34:15,508 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-14 16:34:15,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-14 16:34:15,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:34:15,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:34:15,512 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:34:15,512 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 16:34:15,518 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-14 16:34:15,519 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-14 16:34:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 16:34:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:15,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441403609] [2022-07-14 16:34:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:15,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:15,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-07-14 16:34:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756856946] [2022-07-14 16:34:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:15,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:34:15,859 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-14 16:34:15,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:34:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756856946] [2022-07-14 16:34:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756856946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:34:15,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:34:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:34:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850462209] [2022-07-14 16:34:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:34:15,866 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:34:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:34:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 16:34:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 16:34:15,899 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-14 16:34:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:34:15,907 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-07-14 16:34:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:34:15,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2022-07-14 16:34:15,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-14 16:34:15,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2022-07-14 16:34:15,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 16:34:15,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 16:34:15,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2022-07-14 16:34:15,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:34:15,921 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-14 16:34:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2022-07-14 16:34:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-14 16:34:15,941 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-14 16:34:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-07-14 16:34:15,944 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-14 16:34:15,944 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-14 16:34:15,944 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:34:15,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-07-14 16:34:15,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-14 16:34:15,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:34:15,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:34:15,948 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:34:15,948 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:34:15,948 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-14 16:34:15,949 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-14 16:34:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 16:34:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:15,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216188272] [2022-07-14 16:34:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:15,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-07-14 16:34:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532594232] [2022-07-14 16:34:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:34:16,259 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-14 16:34:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:34:16,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532594232] [2022-07-14 16:34:16,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532594232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:34:16,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:34:16,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:34:16,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138821900] [2022-07-14 16:34:16,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:34:16,261 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:34:16,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:34:16,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:34:16,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:34:16,262 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-14 16:34:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:34:16,361 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-07-14 16:34:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:34:16,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-07-14 16:34:16,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-07-14 16:34:16,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2022-07-14 16:34:16,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-14 16:34:16,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-14 16:34:16,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2022-07-14 16:34:16,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:34:16,366 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-07-14 16:34:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2022-07-14 16:34:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-14 16:34:16,368 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-14 16:34:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-07-14 16:34:16,369 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-14 16:34:16,369 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-14 16:34:16,369 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:34:16,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-07-14 16:34:16,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 16:34:16,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:34:16,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:34:16,371 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:34:16,371 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:34:16,371 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-14 16:34:16,371 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-14 16:34:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 16:34:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533841519] [2022-07-14 16:34:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-07-14 16:34:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375653250] [2022-07-14 16:34:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-07-14 16:34:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559882809] [2022-07-14 16:34:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:34:16,458 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-14 16:34:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:34:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559882809] [2022-07-14 16:34:16,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559882809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:34:16,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:34:16,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:34:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063699052] [2022-07-14 16:34:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:34:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:34:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:34:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:34:16,675 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-14 16:34:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:34:16,866 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-07-14 16:34:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 16:34:16,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2022-07-14 16:34:16,869 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-07-14 16:34:16,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2022-07-14 16:34:16,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-14 16:34:16,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-14 16:34:16,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2022-07-14 16:34:16,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:34:16,870 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-07-14 16:34:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2022-07-14 16:34:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-14 16:34:16,872 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-14 16:34:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-07-14 16:34:16,873 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-07-14 16:34:16,873 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-07-14 16:34:16,873 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:34:16,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2022-07-14 16:34:16,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-07-14 16:34:16,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:34:16,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:34:16,874 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:34:16,874 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:34:16,875 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-14 16:34:16,875 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-14 16:34:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 16:34:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266994803] [2022-07-14 16:34:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-07-14 16:34:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959614959] [2022-07-14 16:34:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,907 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:34:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-07-14 16:34:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:34:16,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724233688] [2022-07-14 16:34:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:34:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:34:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:34:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:34:16,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:34:17,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:34:17 BoogieIcfgContainer [2022-07-14 16:34:17,519 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:34:17,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:34:17,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:34:17,520 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:34:17,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:34:15" (3/4) ... [2022-07-14 16:34:17,523 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 16:34:17,551 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 16:34:17,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:34:17,552 INFO L158 Benchmark]: Toolchain (without parser) took 3276.50ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 67.9MB in the beginning and 111.8MB in the end (delta: -43.8MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,552 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:34:17,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.15ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 67.8MB in the beginning and 110.0MB in the end (delta: -42.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.98ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,553 INFO L158 Benchmark]: Boogie Preprocessor took 55.61ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 106.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,554 INFO L158 Benchmark]: RCFGBuilder took 560.41ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 85.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,554 INFO L158 Benchmark]: BuchiAutomizer took 2103.74ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 112.8MB in the end (delta: -28.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,554 INFO L158 Benchmark]: Witness Printer took 30.92ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 111.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:34:17,562 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.18ms. Allocated memory is still 96.5MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.15ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 67.8MB in the beginning and 110.0MB in the end (delta: -42.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.98ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.61ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 106.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 560.41ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 85.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2103.74ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 112.8MB in the end (delta: -28.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 30.92ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 111.8MB in the end (delta: 1.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 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. 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.2s 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@1ceebcac=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34d22204=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50a45ea7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@732f1d86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c2f755c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50a45ea7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1487b967=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3556f021=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a13eae4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@44475b84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e70cd83=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f047771=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46c65e59=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3556f021=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2073a064=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@732f1d86=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@44475b84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40469af6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d013c52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23dfde2d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74c6ec14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d013c52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d171f1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a13eae4=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29622554=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@6b70c97=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f546670=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@197629b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ceebcac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f546670=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@197629b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f047771=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c2f755c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26479fdd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@d153ec3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e70cd83=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2073a064=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74c6ec14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34d22204=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d171f1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46c65e59=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23dfde2d=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48f50767=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29622554=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@457f6533=9, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@d153ec3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1487b967=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@590d2006=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@26479fdd=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-14 16:34:17,622 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)