./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.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_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:54:26,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:54:26,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:54:26,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:54:26,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:54:26,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:54:26,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:54:26,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:54:26,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:54:26,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:54:26,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:54:26,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:54:26,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:54:26,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:54:26,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:54:26,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:54:26,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:54:26,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:54:26,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:54:26,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:54:26,973 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:54:26,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:54:26,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:54:26,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:54:26,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:54:26,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:54:26,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:54:26,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:54:26,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:54:26,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:54:26,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:54:26,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:54:26,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:54:26,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:54:26,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:54:26,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:54:26,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:54:26,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:54:26,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:54:26,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:54:26,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:54:26,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:54:26,990 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:27,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:54:27,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:54:27,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:54:27,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:54:27,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:54:27,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:54:27,015 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:54:27,015 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:54:27,015 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:54:27,016 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:54:27,016 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:54:27,016 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:54:27,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:54:27,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:54:27,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:54:27,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:54:27,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:54:27,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:54:27,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:54:27,020 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:54:27,020 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2022-07-13 04:54:27,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:54:27,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:54:27,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:54:27,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:54:27,233 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:54:27,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-13 04:54:27,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b9c37df/d5e2ddbc4c0f4a53ae68b831a90a3598/FLAG0f8a91a07 [2022-07-13 04:54:27,766 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:54:27,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-13 04:54:27,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b9c37df/d5e2ddbc4c0f4a53ae68b831a90a3598/FLAG0f8a91a07 [2022-07-13 04:54:27,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b9c37df/d5e2ddbc4c0f4a53ae68b831a90a3598 [2022-07-13 04:54:27,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:54:27,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:54:27,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:27,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:54:27,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:54:27,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:27" (1/1) ... [2022-07-13 04:54:27,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17db0447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:27, skipping insertion in model container [2022-07-13 04:54:27,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:27" (1/1) ... [2022-07-13 04:54:27,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:54:27,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:54:28,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:28,052 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:54:28,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:28,095 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:54:28,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:28 WrapperNode [2022-07-13 04:54:28,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:28,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:28,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:54:28,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:54:28,102 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:28" (1/1) ... [2022-07-13 04:54:28,114 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:28" (1/1) ... [2022-07-13 04:54:28,133 INFO L137 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-07-13 04:54:28,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:28,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:54:28,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:54:28,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:54:28,139 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:28" (1/1) ... [2022-07-13 04:54:28,139 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:28" (1/1) ... [2022-07-13 04:54:28,142 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:28" (1/1) ... [2022-07-13 04:54:28,142 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:28" (1/1) ... [2022-07-13 04:54:28,148 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:28" (1/1) ... [2022-07-13 04:54:28,151 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:28" (1/1) ... [2022-07-13 04:54:28,152 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:28" (1/1) ... [2022-07-13 04:54:28,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:54:28,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:54:28,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:54:28,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:54:28,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:28" (1/1) ... [2022-07-13 04:54:28,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:28,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:28,183 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:28,200 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:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 04:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 04:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 04:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:54:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:54:28,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:54:28,327 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:54:28,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:54:28,533 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:54:28,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:54:28,538 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:54:28,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:28 BoogieIcfgContainer [2022-07-13 04:54:28,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:54:28,540 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:54:28,540 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:54:28,542 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:54:28,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:28,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:54:27" (1/3) ... [2022-07-13 04:54:28,543 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dcef9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:28, skipping insertion in model container [2022-07-13 04:54:28,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:28,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:28" (2/3) ... [2022-07-13 04:54:28,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dcef9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:28, skipping insertion in model container [2022-07-13 04:54:28,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:28,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:28" (3/3) ... [2022-07-13 04:54:28,545 INFO L354 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2022-07-13 04:54:28,577 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:54:28,577 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:54:28,577 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:54:28,577 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:54:28,578 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:54:28,578 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:54:28,578 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:54:28,578 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:54:28,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 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:28,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:54:28,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:28,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:28,598 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:28,598 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:54:28,598 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:54:28,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 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:28,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:54:28,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:28,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:28,601 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:28,601 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:54:28,606 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); 16#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~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~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); 12#L545-2true [2022-07-13 04:54:28,606 INFO L754 eck$LassoCheckResult]: Loop: 12#L545-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; 14#L535-2true assume !true; 17#L534-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); 18#L540true 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; 20#L540-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); 9#L545true 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; 12#L545-2true [2022-07-13 04:54:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 04:54:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:28,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202407498] [2022-07-13 04:54:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:28,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:28,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-07-13 04:54:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55869095] [2022-07-13 04:54:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:28,846 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:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55869095] [2022-07-13 04:54:28,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55869095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:28,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:28,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:54:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311794004] [2022-07-13 04:54:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:28,851 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:54:28,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 04:54:28,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 04:54:28,880 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 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) 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:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:28,887 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-07-13 04:54:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 04:54:28,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-07-13 04:54:28,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:54:28,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2022-07-13 04:54:28,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-13 04:54:28,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-13 04:54:28,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2022-07-13 04:54:28,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:28,899 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-07-13 04:54:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2022-07-13 04:54:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 04:54:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 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:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2022-07-13 04:54:28,919 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-07-13 04:54:28,919 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-07-13 04:54:28,919 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:54:28,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2022-07-13 04:54:28,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-13 04:54:28,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:28,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:28,922 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:28,922 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:28,922 INFO L752 eck$LassoCheckResult]: Stem: 60#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); 61#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~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~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); 66#L545-2 [2022-07-13 04:54:28,922 INFO L754 eck$LassoCheckResult]: Loop: 66#L545-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; 62#L535-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; 56#L534-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; 57#L534-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; 58#L534-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); 70#L540 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; 71#L540-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); 65#L545 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; 66#L545-2 [2022-07-13 04:54:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 04:54:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:28,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680140069] [2022-07-13 04:54:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:28,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:28,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-07-13 04:54:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:28,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280200876] [2022-07-13 04:54:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:29,163 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:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:29,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280200876] [2022-07-13 04:54:29,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280200876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:29,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:29,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:54:29,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211456652] [2022-07-13 04:54:29,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:29,167 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:54:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:29,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:29,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:29,168 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 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:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:29,264 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-07-13 04:54:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:54:29,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2022-07-13 04:54:29,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2022-07-13 04:54:29,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2022-07-13 04:54:29,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-13 04:54:29,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-13 04:54:29,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2022-07-13 04:54:29,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:29,268 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 41 transitions. [2022-07-13 04:54:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2022-07-13 04:54:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-13 04:54:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 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:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-07-13 04:54:29,270 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-07-13 04:54:29,270 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-07-13 04:54:29,270 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:54:29,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2022-07-13 04:54:29,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-07-13 04:54:29,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:29,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:29,271 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:29,272 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:29,272 INFO L752 eck$LassoCheckResult]: Stem: 118#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); 119#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~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~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); 124#L545-2 [2022-07-13 04:54:29,272 INFO L754 eck$LassoCheckResult]: Loop: 124#L545-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; 120#L535-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; 113#L534-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; 114#L534-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; 135#L534-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); 129#L540 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; 130#L540-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); 123#L545 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; 124#L545-2 [2022-07-13 04:54:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 04:54:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:29,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577049383] [2022-07-13 04:54:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-07-13 04:54:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:29,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605301775] [2022-07-13 04:54:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-07-13 04:54:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:29,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161083823] [2022-07-13 04:54:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:29,385 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:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161083823] [2022-07-13 04:54:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161083823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:29,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:29,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:54:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379465540] [2022-07-13 04:54:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:29,580 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 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:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:29,760 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-07-13 04:54:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:54:29,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2022-07-13 04:54:29,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2022-07-13 04:54:29,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2022-07-13 04:54:29,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-13 04:54:29,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-13 04:54:29,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2022-07-13 04:54:29,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:29,763 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 80 transitions. [2022-07-13 04:54:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2022-07-13 04:54:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2022-07-13 04:54:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-07-13 04:54:29,766 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-07-13 04:54:29,766 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-07-13 04:54:29,766 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:54:29,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2022-07-13 04:54:29,766 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-07-13 04:54:29,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:29,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:29,767 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 04:54:29,767 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:29,767 INFO L752 eck$LassoCheckResult]: Stem: 208#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); 209#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~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~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); 215#L545-2 [2022-07-13 04:54:29,767 INFO L754 eck$LassoCheckResult]: Loop: 215#L545-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; 218#L535-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; 204#L534-1 assume !main_#t~short7#1; 205#L534-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; 234#L534-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); 232#L540 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; 227#L540-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); 214#L545 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; 215#L545-2 [2022-07-13 04:54:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 04:54:29,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:29,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965662578] [2022-07-13 04:54:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-07-13 04:54:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:29,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120503693] [2022-07-13 04:54:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-07-13 04:54:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:29,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432804760] [2022-07-13 04:54:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,800 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:29,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:30,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:54:30 BoogieIcfgContainer [2022-07-13 04:54:30,189 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:54:30,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:54:30,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:54:30,190 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:54:30,190 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:28" (3/4) ... [2022-07-13 04:54:30,192 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 04:54:30,213 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 04:54:30,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:54:30,214 INFO L158 Benchmark]: Toolchain (without parser) took 2412.70ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 48.5MB in the end (delta: 5.6MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-07-13 04:54:30,214 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory was 71.9MB in the beginning and 71.9MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:30,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.99ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 53.8MB in the beginning and 84.5MB in the end (delta: -30.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2022-07-13 04:54:30,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.98ms. Allocated memory is still 117.4MB. Free memory was 84.5MB in the beginning and 82.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:30,216 INFO L158 Benchmark]: Boogie Preprocessor took 20.01ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 81.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:30,216 INFO L158 Benchmark]: RCFGBuilder took 384.64ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 60.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 04:54:30,216 INFO L158 Benchmark]: BuchiAutomizer took 1649.91ms. Allocated memory is still 117.4MB. Free memory was 60.9MB in the beginning and 50.1MB in the end (delta: 10.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:30,217 INFO L158 Benchmark]: Witness Printer took 23.74ms. Allocated memory is still 117.4MB. Free memory was 50.1MB in the beginning and 48.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:30,219 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.13ms. Allocated memory is still 94.4MB. Free memory was 71.9MB in the beginning and 71.9MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.99ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 53.8MB in the beginning and 84.5MB in the end (delta: -30.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.98ms. Allocated memory is still 117.4MB. Free memory was 84.5MB in the beginning and 82.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.01ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 81.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 384.64ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 60.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 1649.91ms. Allocated memory is still 117.4MB. Free memory was 60.9MB in the beginning and 50.1MB in the end (delta: 10.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 23.74ms. Allocated memory is still 117.4MB. Free memory was 50.1MB in the beginning and 48.5MB in the end (delta: 1.6MB). 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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. 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, 27 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, 50 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 80 mSDtfsCounter, 156 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: 532]: 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@16036697=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40b7f1c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e389bf5=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b17ed00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@aaa21d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@706f6215=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b17ed00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@121e6b01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@713efb06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e11bf84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f0b5183=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@443ddfc7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6af08709=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@713efb06=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1550879=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@aaa21d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f0b5183=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c8b981a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@852d789=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a6037a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3056cc6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a6037a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31c73a40=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e11bf84=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@28608346=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f568926=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16036697=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f568926=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@706f6215=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40b7f1c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c876871=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@44225e61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@443ddfc7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1550879=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3056cc6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e389bf5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31c73a40=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6af08709=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@44225e61=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284c1194=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2712cdaf=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@121e6b01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f22545f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c876871=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 532]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] EXPR n->left [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 04:54:30,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)