./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:46:15,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:46:15,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:46:15,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:46:15,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:46:15,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:46:15,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:46:15,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:46:15,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:46:15,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:46:15,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:46:15,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:46:15,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:46:15,702 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:46:15,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:46:15,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:46:15,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:46:15,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:46:15,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:46:15,707 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 [2025-02-08 06:46:16,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:46:16,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:46:16,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:46:16,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:46:16,020 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:46:16,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2025-02-08 06:46:17,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e3d32ce7/cbc6d90a279e4f76af9bead67dffd172/FLAGa06a9e964 [2025-02-08 06:46:17,659 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:46:17,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2025-02-08 06:46:17,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e3d32ce7/cbc6d90a279e4f76af9bead67dffd172/FLAGa06a9e964 [2025-02-08 06:46:17,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e3d32ce7/cbc6d90a279e4f76af9bead67dffd172 [2025-02-08 06:46:17,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:46:17,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:46:17,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:46:17,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:46:17,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:46:17,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:46:17" (1/1) ... [2025-02-08 06:46:17,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ede9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:17, skipping insertion in model container [2025-02-08 06:46:17,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:46:17" (1/1) ... [2025-02-08 06:46:17,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:46:17,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:46:17,971 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:46:18,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:46:18,050 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:46:18,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18 WrapperNode [2025-02-08 06:46:18,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:46:18,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:46:18,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:46:18,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:46:18,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,108 INFO L138 Inliner]: procedures = 18, calls = 199, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 402 [2025-02-08 06:46:18,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:46:18,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:46:18,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:46:18,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:46:18,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,159 INFO L175 MemorySlicer]: Split 180 memory accesses to 5 slices as follows [2, 7, 2, 128, 41]. 71 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 7, 2, 0, 0]. The 127 writes are split as follows [0, 0, 0, 127, 0]. [2025-02-08 06:46:18,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:46:18,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:46:18,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:46:18,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:46:18,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (1/1) ... [2025-02-08 06:46:18,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:46:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:18,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:46:18,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:46:18,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:46:18,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:46:18,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:46:18,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:46:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 06:46:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:46:18,388 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:46:18,389 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:46:25,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-08 06:46:25,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume #valid == main_old_#valid#1;assume #valid == main_old_#valid#1;#t~ret47#1 := main_#res#1;havoc main_#t~nondet4#1.base, main_#t~nondet4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#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~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1, main_~Id_MCDC_89____CPAchecker_TMP_2~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__Id_MCDC_92~0#1, main_~__tmp_1~0#1.base, main_~__tmp_1~0#1.offset, main_~Id_MCDC_89__Id_MCDC_88~0#1.base, main_~Id_MCDC_89__Id_MCDC_88~0#1.offset, main_~Id_MCDC_89__Id_MCDC_94~0#1.base, main_~Id_MCDC_89__Id_MCDC_94~0#1.offset, main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset, main_~Id_MCDC_89__Id_MCDC_96~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~0#1, main_~main__Id_MCDC_97~0#1.base, main_~main__Id_MCDC_97~0#1.offset, main_~main__Id_MCDC_98~0#1.base, main_~main__Id_MCDC_98~0#1.offset, main_~main__Id_MCDC_99~0#1.base, main_~main__Id_MCDC_99~0#1.offset, main_~main__Id_MCDC_100~0#1.base, main_~main__Id_MCDC_100~0#1.offset, main_~main__Id_MCDC_101~0#1.base, main_~main__Id_MCDC_101~0#1.offset, main_~main__Id_MCDC_102~0#1.base, main_~main__Id_MCDC_102~0#1.offset, main_~main__Id_MCDC_103~0#1, main_~main__Id_MCDC_104~0#1, main_~main__Id_MCDC_105~0#1, main_~main__Id_MCDC_106~0#1, main_~main__Id_MCDC_107~0#1, main_~main__Id_MCDC_108~0#1, main_~main__Id_MCDC_109~0#1, main_~main__Id_MCDC_110~0#1, main_~main__Id_MCDC_111~0#1, main_~main__Id_MCDC_112~0#1.base, main_~main__Id_MCDC_112~0#1.offset, main_~main__Id_MCDC_113~0#1, main_~main__Id_MCDC_114~0#1, main_~main__Id_MCDC_115~0#1, main_~main__Id_MCDC_116~0#1, main_~main__Id_MCDC_117~0#1, main_~main__Id_MCDC_118~0#1, main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_38.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_38.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_39.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_39.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_40.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_40.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_41.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_41.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_42.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_42.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_43.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_43.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_44.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_44.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_45.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_45.offset, main_~main__Id_MCDC_120~0#1.Id_MCDC_46.base, main_~main__Id_MCDC_120~0#1.Id_MCDC_46.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_29.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_29.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_30.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_30.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_31.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_31.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_32.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_32.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_33.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_33.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_34.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_34.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_35.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_35.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_36.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_36.offset, main_~main__Id_MCDC_121~0#1.Id_MCDC_37.base, main_~main__Id_MCDC_121~0#1.Id_MCDC_37.offset;assume { :end_inline_main } true; [2025-02-08 06:46:25,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: assume !(#valid == main_old_#valid#1); [2025-02-08 06:46:25,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc main_~Id_MCDC_89____CPAchecker_TMP_2~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__Id_MCDC_92~0#1;call ULTIMATE.dealloc(main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset);havoc main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset;havoc main_~__tmp_1~0#1.base, main_~__tmp_1~0#1.offset, main_~Id_MCDC_89__Id_MCDC_88~0#1.base, main_~Id_MCDC_89__Id_MCDC_88~0#1.offset, main_~Id_MCDC_89__Id_MCDC_94~0#1.base, main_~Id_MCDC_89__Id_MCDC_94~0#1.offset, main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset, main_~Id_MCDC_89__Id_MCDC_96~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset);havoc main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset; [2025-02-08 06:46:25,328 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2025-02-08 06:46:25,328 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:46:25,346 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:46:25,347 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:46:25,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:25 BoogieIcfgContainer [2025-02-08 06:46:25,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:46:25,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:46:25,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:46:25,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:46:25,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:46:17" (1/3) ... [2025-02-08 06:46:25,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6240c479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:46:25, skipping insertion in model container [2025-02-08 06:46:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:18" (2/3) ... [2025-02-08 06:46:25,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6240c479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:46:25, skipping insertion in model container [2025-02-08 06:46:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:25" (3/3) ... [2025-02-08 06:46:25,358 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+cfa-reducer.c [2025-02-08 06:46:25,373 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:46:25,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+cfa-reducer.c that has 1 procedures, 179 locations, 1 initial locations, 0 loop locations, and 86 error locations. [2025-02-08 06:46:25,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:46:25,435 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c2aaaf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:46:25,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 06:46:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 90 states have (on average 2.0) internal successors, (180), 177 states have internal predecessors, (180), 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) [2025-02-08 06:46:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:25,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:25,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:25,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-02-08 06:46:25,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 222367, now seen corresponding path program 1 times [2025-02-08 06:46:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908200959] [2025-02-08 06:46:25,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:25,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:25,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:25,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:25,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:26,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908200959] [2025-02-08 06:46:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908200959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:26,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:26,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:46:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660068975] [2025-02-08 06:46:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:26,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:26,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:26,445 INFO L87 Difference]: Start difference. First operand has 178 states, 90 states have (on average 2.0) internal successors, (180), 177 states have internal predecessors, (180), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-08 06:46:31,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:46:36,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:46:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:36,505 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2025-02-08 06:46:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-02-08 06:46:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:36,513 INFO L225 Difference]: With dead ends: 137 [2025-02-08 06:46:36,514 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 06:46:36,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:46:36,520 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 213 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:36,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 57 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2025-02-08 06:46:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 06:46:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-08 06:46:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 132 states have internal predecessors, (132), 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) [2025-02-08 06:46:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 132 transitions. [2025-02-08 06:46:36,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 132 transitions. Word has length 3 [2025-02-08 06:46:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:36,556 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 132 transitions. [2025-02-08 06:46:36,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-08 06:46:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 132 transitions. [2025-02-08 06:46:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:36,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:36,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:46:36,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-02-08 06:46:36,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 222368, now seen corresponding path program 1 times [2025-02-08 06:46:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881404750] [2025-02-08 06:46:36,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:36,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:36,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:36,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:36,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:37,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881404750] [2025-02-08 06:46:37,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881404750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:37,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:46:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588373002] [2025-02-08 06:46:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:37,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:37,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:37,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:37,171 INFO L87 Difference]: Start difference. First operand 133 states and 132 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-08 06:46:42,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:46:46,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:46:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:46,849 INFO L93 Difference]: Finished difference Result 92 states and 91 transitions. [2025-02-08 06:46:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-02-08 06:46:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:46,851 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:46:46,851 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:46:46,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:46,851 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:46,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 101 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2025-02-08 06:46:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:46:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:46:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 91 states have internal predecessors, (91), 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) [2025-02-08 06:46:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 91 transitions. [2025-02-08 06:46:46,858 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 91 transitions. Word has length 3 [2025-02-08 06:46:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:46,858 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 91 transitions. [2025-02-08 06:46:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-08 06:46:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 91 transitions. [2025-02-08 06:46:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 06:46:46,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:46,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:46:46,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-02-08 06:46:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -323033713, now seen corresponding path program 1 times [2025-02-08 06:46:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31662099] [2025-02-08 06:46:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:51,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 06:46:51,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 06:46:51,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:51,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31662099] [2025-02-08 06:46:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31662099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:52,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:46:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763334166] [2025-02-08 06:46:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:52,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:52,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:52,100 INFO L87 Difference]: Start difference. First operand 92 states and 91 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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) [2025-02-08 06:46:57,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:46:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:57,650 INFO L93 Difference]: Finished difference Result 91 states and 90 transitions. [2025-02-08 06:46:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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) Word has length 88 [2025-02-08 06:46:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:57,652 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:46:57,652 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:46:57,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:46:57,653 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:57,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-02-08 06:46:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:46:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 06:46:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 90 states have internal predecessors, (90), 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) [2025-02-08 06:46:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 90 transitions. [2025-02-08 06:46:57,659 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 90 transitions. Word has length 88 [2025-02-08 06:46:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:57,660 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 90 transitions. [2025-02-08 06:46:57,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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) [2025-02-08 06:46:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 90 transitions. [2025-02-08 06:46:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 06:46:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:57,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:46:57,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-02-08 06:46:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -323033712, now seen corresponding path program 1 times [2025-02-08 06:46:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543782903] [2025-02-08 06:46:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:01,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 06:47:01,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 06:47:01,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:01,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543782903] [2025-02-08 06:47:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543782903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:47:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782507404] [2025-02-08 06:47:03,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:03,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:47:03,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:03,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:47:03,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:47:03,135 INFO L87 Difference]: Start difference. First operand 91 states and 90 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-02-08 06:47:08,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:47:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:09,294 INFO L93 Difference]: Finished difference Result 90 states and 89 transitions. [2025-02-08 06:47:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:47:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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) Word has length 88 [2025-02-08 06:47:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:09,295 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:47:09,295 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:47:09,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:47:09,296 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:09,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 213 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-08 06:47:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:47:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 06:47:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0) internal successors, (88), 88 states have internal predecessors, (88), 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) [2025-02-08 06:47:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 88 transitions. [2025-02-08 06:47:09,303 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 88 transitions. Word has length 88 [2025-02-08 06:47:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 88 transitions. [2025-02-08 06:47:09,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-02-08 06:47:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 88 transitions. [2025-02-08 06:47:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 06:47:09,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:47:09,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:47:09,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:47:09,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-02-08 06:47:09,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:47:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash -323034000, now seen corresponding path program 1 times [2025-02-08 06:47:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:47:09,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191345710] [2025-02-08 06:47:09,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:47:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:47:12,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 06:47:12,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 06:47:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:47:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:47:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:47:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:47:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191345710] [2025-02-08 06:47:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191345710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:47:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:47:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:47:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654794037] [2025-02-08 06:47:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:47:13,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:47:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:47:13,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:47:13,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:47:13,239 INFO L87 Difference]: Start difference. First operand 89 states and 88 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2025-02-08 06:47:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:47:13,258 INFO L93 Difference]: Finished difference Result 87 states and 86 transitions. [2025-02-08 06:47:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:47:13,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) Word has length 88 [2025-02-08 06:47:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:47:13,259 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:47:13,259 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:47:13,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:47:13,260 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:47:13,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:47:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:47:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:47:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-02-08 06:47:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:47:13,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2025-02-08 06:47:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:47:13,261 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:47:13,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2025-02-08 06:47:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:47:13,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:47:13,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (85 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (84 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2025-02-08 06:47:13,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2025-02-08 06:47:13,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2025-02-08 06:47:13,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2025-02-08 06:47:13,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2025-02-08 06:47:13,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2025-02-08 06:47:13,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2025-02-08 06:47:13,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2025-02-08 06:47:13,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2025-02-08 06:47:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2025-02-08 06:47:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2025-02-08 06:47:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2025-02-08 06:47:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2025-02-08 06:47:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2025-02-08 06:47:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2025-02-08 06:47:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2025-02-08 06:47:13,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2025-02-08 06:47:13,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2025-02-08 06:47:13,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2025-02-08 06:47:13,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 86 remaining) [2025-02-08 06:47:13,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2025-02-08 06:47:13,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 86 remaining) [2025-02-08 06:47:13,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 86 remaining) [2025-02-08 06:47:13,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:47:13,279 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 06:47:13,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:47:13,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:47:13 BoogieIcfgContainer [2025-02-08 06:47:13,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:47:13,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:47:13,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:47:13,290 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:47:13,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:25" (3/4) ... [2025-02-08 06:47:13,293 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:47:13,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 06:47:13,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 06:47:13,313 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 06:47:13,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:47:13,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:47:13,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:47:13,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:47:13,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:47:13,476 INFO L158 Benchmark]: Toolchain (without parser) took 55779.62ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 106.4MB in the beginning and 525.4MB in the end (delta: -419.0MB). Peak memory consumption was 386.6MB. Max. memory is 16.1GB. [2025-02-08 06:47:13,477 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:47:13,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.63ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 88.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:47:13,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.77ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 84.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:47:13,478 INFO L158 Benchmark]: Boogie Preprocessor took 80.40ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 80.4MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:47:13,478 INFO L158 Benchmark]: IcfgBuilder took 7154.41ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 59.3MB in the end (delta: 21.1MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-02-08 06:47:13,478 INFO L158 Benchmark]: TraceAbstraction took 47937.88ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 58.4MB in the beginning and 545.1MB in the end (delta: -486.7MB). Peak memory consumption was 325.6MB. Max. memory is 16.1GB. [2025-02-08 06:47:13,479 INFO L158 Benchmark]: Witness Printer took 185.27ms. Allocated memory is still 947.9MB. Free memory was 545.1MB in the beginning and 525.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:47:13,480 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.63ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 88.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.77ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 84.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.40ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 80.4MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 7154.41ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 59.3MB in the end (delta: 21.1MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47937.88ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 58.4MB in the beginning and 545.1MB in the end (delta: -486.7MB). Peak memory consumption was 325.6MB. Max. memory is 16.1GB. * Witness Printer took 185.27ms. Allocated memory is still 947.9MB. Free memory was 545.1MB in the beginning and 525.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 179 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 47.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 715 SdHoareTripleChecker+Invalid, 29.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 359 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:47:13,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE