./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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+nlh-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 e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:44:04,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:44:04,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:44:04,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:44:04,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:44:04,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:44:04,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:44:04,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:44:04,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:44:04,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:44:04,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:44:04,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:44:04,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:44:04,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:44:04,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:44:04,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:44:04,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:04,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:44:04,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:44:04,708 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 -> e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 [2025-02-06 10:44:04,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:44:04,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:44:04,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:44:04,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:44:04,953 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:44:04,954 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+nlh-reducer.c [2025-02-06 10:44:06,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0de38172a/dbeae29abc0840b6aaf7e36647bc47f3/FLAGd419db5d4 [2025-02-06 10:44:06,552 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:44:06,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2025-02-06 10:44:06,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0de38172a/dbeae29abc0840b6aaf7e36647bc47f3/FLAGd419db5d4 [2025-02-06 10:44:06,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0de38172a/dbeae29abc0840b6aaf7e36647bc47f3 [2025-02-06 10:44:06,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:44:06,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:44:06,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:06,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:44:06,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:44:06,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:06" (1/1) ... [2025-02-06 10:44:06,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef63d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:06, skipping insertion in model container [2025-02-06 10:44:06,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:06" (1/1) ... [2025-02-06 10:44:06,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:44:06,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:06,937 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:44:07,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:07,042 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:44:07,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07 WrapperNode [2025-02-06 10:44:07,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:07,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:07,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:44:07,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:44:07,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,127 INFO L138 Inliner]: procedures = 18, calls = 620, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2285 [2025-02-06 10:44:07,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:07,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:44:07,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:44:07,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:44:07,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,188 INFO L175 MemorySlicer]: Split 221 memory accesses to 5 slices as follows [2, 7, 2, 41, 169]. 76 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, 0, 127]. [2025-02-06 10:44:07,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:44:07,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:44:07,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:44:07,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:44:07,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (1/1) ... [2025-02-06 10:44:07,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:07,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:44:07,289 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-06 10:44:07,292 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-06 10:44:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:44:07,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 10:44:07,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:44:07,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 10:44:07,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:44:07,477 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:44:07,478 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:44:14,446 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: havoc main_~__tmp_44~0#1, main_~__VERIFIER_assert__Id_MCDC_92~42#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~41#1, main_~Id_MCDC_89____CPAchecker_TMP_0~42#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~42#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~42#1;havoc main_~__tmp_43~0#1, main_~__VERIFIER_assert__Id_MCDC_92~41#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~40#1, main_~Id_MCDC_89____CPAchecker_TMP_0~41#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~41#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~41#1;havoc main_~__tmp_42~0#1, main_~__VERIFIER_assert__Id_MCDC_92~40#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~39#1, main_~Id_MCDC_89____CPAchecker_TMP_0~40#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~40#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~40#1;havoc main_~__tmp_41~0#1, main_~__VERIFIER_assert__Id_MCDC_92~39#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~38#1, main_~Id_MCDC_89____CPAchecker_TMP_0~39#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~39#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~39#1;havoc main_~__tmp_40~0#1, main_~__VERIFIER_assert__Id_MCDC_92~38#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~37#1, main_~Id_MCDC_89____CPAchecker_TMP_0~38#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~38#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~38#1;havoc main_~__tmp_39~0#1, main_~__VERIFIER_assert__Id_MCDC_92~37#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~36#1, main_~Id_MCDC_89____CPAchecker_TMP_0~37#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~37#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~37#1;havoc main_~__tmp_38~0#1, main_~__VERIFIER_assert__Id_MCDC_92~36#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~35#1, main_~Id_MCDC_89____CPAchecker_TMP_0~36#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~36#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~36#1;havoc main_~__tmp_37~0#1, main_~__VERIFIER_assert__Id_MCDC_92~35#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~34#1, main_~Id_MCDC_89____CPAchecker_TMP_0~35#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~35#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~35#1;havoc main_~__tmp_36~0#1, main_~__VERIFIER_assert__Id_MCDC_92~34#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~33#1, main_~Id_MCDC_89____CPAchecker_TMP_0~34#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~34#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~34#1;havoc main_~__tmp_35~0#1, main_~__VERIFIER_assert__Id_MCDC_92~33#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~32#1, main_~Id_MCDC_89____CPAchecker_TMP_0~33#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~33#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~33#1;havoc main_~__tmp_34~0#1, main_~__VERIFIER_assert__Id_MCDC_92~32#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~31#1, main_~Id_MCDC_89____CPAchecker_TMP_0~32#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~32#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~32#1;havoc main_~__tmp_33~0#1, main_~__VERIFIER_assert__Id_MCDC_92~31#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~30#1, main_~Id_MCDC_89____CPAchecker_TMP_0~31#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~31#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~31#1;havoc main_~__tmp_32~0#1, main_~__VERIFIER_assert__Id_MCDC_92~30#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~29#1, main_~Id_MCDC_89____CPAchecker_TMP_0~30#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~30#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~30#1;havoc main_~__tmp_31~0#1, main_~__VERIFIER_assert__Id_MCDC_92~29#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~28#1, main_~Id_MCDC_89____CPAchecker_TMP_0~29#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~29#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~29#1;havoc main_~__tmp_30~0#1, main_~__VERIFIER_assert__Id_MCDC_92~28#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~27#1, main_~Id_MCDC_89____CPAchecker_TMP_0~28#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~28#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~28#1;havoc main_~__tmp_29~0#1, main_~__VERIFIER_assert__Id_MCDC_92~27#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~26#1, main_~Id_MCDC_89____CPAchecker_TMP_0~27#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~27#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~27#1;havoc main_~__tmp_28~0#1, main_~__VERIFIER_assert__Id_MCDC_92~26#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~25#1, main_~Id_MCDC_89____CPAchecker_TMP_0~26#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~26#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~26#1;havoc main_~__tmp_27~0#1, main_~__VERIFIER_assert__Id_MCDC_92~25#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~24#1, main_~Id_MCDC_89____CPAchecker_TMP_0~25#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~25#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~25#1;havoc main_~__tmp_26~0#1, main_~__VERIFIER_assert__Id_MCDC_92~24#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~23#1, main_~Id_MCDC_89____CPAchecker_TMP_0~24#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~24#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~24#1;havoc main_~__tmp_25~0#1, main_~__VERIFIER_assert__Id_MCDC_92~23#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~22#1, main_~Id_MCDC_89____CPAchecker_TMP_0~23#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~23#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~23#1;havoc main_~__tmp_24~0#1, main_~__VERIFIER_assert__Id_MCDC_92~22#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~21#1, main_~Id_MCDC_89____CPAchecker_TMP_0~22#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~22#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~22#1;havoc main_~__tmp_23~0#1, main_~__VERIFIER_assert__Id_MCDC_92~21#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~20#1, main_~Id_MCDC_89____CPAchecker_TMP_0~21#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~21#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~21#1;havoc main_~__tmp_22~0#1, main_~__VERIFIER_assert__Id_MCDC_92~20#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~19#1, main_~Id_MCDC_89____CPAchecker_TMP_0~20#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~20#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~20#1;havoc main_~__tmp_21~0#1, main_~__VERIFIER_assert__Id_MCDC_92~19#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~18#1, main_~Id_MCDC_89____CPAchecker_TMP_0~19#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~19#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~19#1;havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__Id_MCDC_92~18#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~17#1, main_~Id_MCDC_89____CPAchecker_TMP_0~18#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~18#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~18#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__Id_MCDC_92~17#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~16#1, main_~Id_MCDC_89____CPAchecker_TMP_0~17#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~17#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~17#1;havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__Id_MCDC_92~16#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~15#1, main_~Id_MCDC_89____CPAchecker_TMP_0~16#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~16#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~16#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__Id_MCDC_92~15#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~14#1, main_~Id_MCDC_89____CPAchecker_TMP_0~15#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~15#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~15#1;havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__Id_MCDC_92~14#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~13#1, main_~Id_MCDC_89____CPAchecker_TMP_0~14#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~14#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~14#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__Id_MCDC_92~13#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~12#1, main_~Id_MCDC_89____CPAchecker_TMP_0~13#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~13#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~13#1;havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__Id_MCDC_92~12#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~11#1, main_~Id_MCDC_89____CPAchecker_TMP_0~12#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~12#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~12#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__Id_MCDC_92~11#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~10#1, main_~Id_MCDC_89____CPAchecker_TMP_0~11#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~11#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~11#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__Id_MCDC_92~10#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~9#1, main_~Id_MCDC_89____CPAchecker_TMP_0~10#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~10#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~10#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__Id_MCDC_92~9#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~8#1, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~9#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__Id_MCDC_92~8#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~7#1, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~8#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__Id_MCDC_92~7#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~6#1, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~7#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__Id_MCDC_92~6#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~5#1, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~6#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__Id_MCDC_92~5#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~4#1, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~5#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__Id_MCDC_92~4#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~3#1, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~4#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__Id_MCDC_92~3#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~2#1, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~3#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__Id_MCDC_92~2#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~1#1, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~2#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__Id_MCDC_92~1#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~1#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-06 10:44:14,508 INFO L? ?]: Removed 646 outVars from TransFormulas that were not future-live. [2025-02-06 10:44:14,509 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:44:14,534 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:44:14,534 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:44:14,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:14 BoogieIcfgContainer [2025-02-06 10:44:14,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:44:14,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:44:14,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:44:14,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:44:14,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:44:06" (1/3) ... [2025-02-06 10:44:14,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ba0228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:14, skipping insertion in model container [2025-02-06 10:44:14,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:07" (2/3) ... [2025-02-06 10:44:14,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ba0228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:14, skipping insertion in model container [2025-02-06 10:44:14,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:14" (3/3) ... [2025-02-06 10:44:14,545 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+nlh-reducer.c [2025-02-06 10:44:14,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:44:14,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+nlh-reducer.c that has 1 procedures, 471 locations, 1 initial locations, 0 loop locations, and 168 error locations. [2025-02-06 10:44:14,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:44:14,597 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;@67f591f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:44:14,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 168 error locations. [2025-02-06 10:44:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 302 states have (on average 2.1258278145695364) internal successors, (642), 470 states have internal predecessors, (642), 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-06 10:44:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:44:14,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:14,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:44:14,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:44:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 31244157, now seen corresponding path program 1 times [2025-02-06 10:44:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44993626] [2025-02-06 10:44:14,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:14,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:44:14,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:44:14,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:14,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:15,005 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-06 10:44:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44993626] [2025-02-06 10:44:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44993626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:15,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:15,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412015284] [2025-02-06 10:44:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:15,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:44:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:15,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:44:15,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:15,026 INFO L87 Difference]: Start difference. First operand has 471 states, 302 states have (on average 2.1258278145695364) internal successors, (642), 470 states have internal predecessors, (642), 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.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-06 10:44:20,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:24,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:29,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:34,161 INFO L93 Difference]: Finished difference Result 471 states and 598 transitions. [2025-02-06 10:44:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:44:34,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-02-06 10:44:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:34,181 INFO L225 Difference]: With dead ends: 471 [2025-02-06 10:44:34,181 INFO L226 Difference]: Without dead ends: 468 [2025-02-06 10:44:34,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 10:44:34,187 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 164 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:34,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1022 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 600 Invalid, 3 Unknown, 0 Unchecked, 19.0s Time] [2025-02-06 10:44:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-06 10:44:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-06 10:44:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.98) internal successors, (594), 467 states have internal predecessors, (594), 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-06 10:44:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 594 transitions. [2025-02-06 10:44:34,241 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 594 transitions. Word has length 4 [2025-02-06 10:44:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:34,241 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 594 transitions. [2025-02-06 10:44:34,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-06 10:44:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 594 transitions. [2025-02-06 10:44:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:44:34,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:34,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:44:34,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:44:34,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr166REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:44:34,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:34,243 INFO L85 PathProgramCache]: Analyzing trace with hash 31275486, now seen corresponding path program 1 times [2025-02-06 10:44:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627212301] [2025-02-06 10:44:34,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:34,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:44:34,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:44:34,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:34,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:34,693 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-06 10:44:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:34,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627212301] [2025-02-06 10:44:34,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627212301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:34,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:34,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480917742] [2025-02-06 10:44:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:34,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:44:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:34,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:44:34,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:34,695 INFO L87 Difference]: Start difference. First operand 468 states and 594 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-06 10:44:40,339 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-06 10:44:44,676 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-06 10:44:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:51,227 INFO L93 Difference]: Finished difference Result 427 states and 553 transitions. [2025-02-06 10:44:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:44:51,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-02-06 10:44:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:51,230 INFO L225 Difference]: With dead ends: 427 [2025-02-06 10:44:51,230 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 10:44:51,230 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-06 10:44:51,231 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 501 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:51,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 471 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 682 Invalid, 2 Unknown, 0 Unchecked, 16.4s Time] [2025-02-06 10:44:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 10:44:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-06 10:44:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 300 states have (on average 1.8433333333333333) internal successors, (553), 426 states have internal predecessors, (553), 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-06 10:44:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 553 transitions. [2025-02-06 10:44:51,249 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 553 transitions. Word has length 4 [2025-02-06 10:44:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:51,249 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 553 transitions. [2025-02-06 10:44:51,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-06 10:44:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 553 transitions. [2025-02-06 10:44:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:44:51,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:51,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:44:51,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:44:51,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr167REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:44:51,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 31275487, now seen corresponding path program 1 times [2025-02-06 10:44:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:51,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154972648] [2025-02-06 10:44:51,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:44:51,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:44:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:51,768 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-06 10:44:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154972648] [2025-02-06 10:44:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154972648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135759582] [2025-02-06 10:44:51,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:51,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:44:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:51,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:44:51,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:51,770 INFO L87 Difference]: Start difference. First operand 427 states and 553 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-06 10:44:56,920 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-06 10:45:01,206 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-06 10:45:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:05,082 INFO L93 Difference]: Finished difference Result 386 states and 512 transitions. [2025-02-06 10:45:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:45:05,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-02-06 10:45:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:05,084 INFO L225 Difference]: With dead ends: 386 [2025-02-06 10:45:05,084 INFO L226 Difference]: Without dead ends: 386 [2025-02-06 10:45:05,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:45:05,084 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 80 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:05,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1068 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 384 Invalid, 2 Unknown, 0 Unchecked, 13.3s Time] [2025-02-06 10:45:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-06 10:45:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-02-06 10:45:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 385 states have internal predecessors, (512), 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-06 10:45:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 512 transitions. [2025-02-06 10:45:05,094 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 512 transitions. Word has length 4 [2025-02-06 10:45:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:05,094 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 512 transitions. [2025-02-06 10:45:05,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-06 10:45:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 512 transitions. [2025-02-06 10:45:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 10:45:05,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:05,096 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-06 10:45:05,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:45:05,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:45:05,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash -272721834, now seen corresponding path program 1 times [2025-02-06 10:45:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:05,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025608533] [2025-02-06 10:45:05,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:09,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 10:45:09,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:45:09,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:09,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:10,089 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-06 10:45:10,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025608533] [2025-02-06 10:45:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025608533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:45:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895005846] [2025-02-06 10:45:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:45:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:10,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:45:10,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:45:10,091 INFO L87 Difference]: Start difference. First operand 386 states and 512 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-06 10:45:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:12,084 INFO L93 Difference]: Finished difference Result 388 states and 512 transitions. [2025-02-06 10:45:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:45:12,085 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-06 10:45:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:12,086 INFO L225 Difference]: With dead ends: 388 [2025-02-06 10:45:12,086 INFO L226 Difference]: Without dead ends: 388 [2025-02-06 10:45:12,086 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-06 10:45:12,087 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 91 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:12,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 760 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 10:45:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-06 10:45:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2025-02-06 10:45:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7033333333333334) internal successors, (511), 385 states have internal predecessors, (511), 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-06 10:45:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2025-02-06 10:45:12,100 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 88 [2025-02-06 10:45:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:12,101 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2025-02-06 10:45:12,101 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-06 10:45:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2025-02-06 10:45:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:45:12,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:12,103 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, 1] [2025-02-06 10:45:12,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:45:12,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:45:12,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 135556034, now seen corresponding path program 1 times [2025-02-06 10:45:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545813924] [2025-02-06 10:45:12,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:15,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:45:15,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:45:15,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:15,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:16,062 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-06 10:45:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545813924] [2025-02-06 10:45:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545813924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:45:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992875123] [2025-02-06 10:45:16,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:16,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:45:16,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:16,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:45:16,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:45:16,063 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-06 10:45:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:16,107 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2025-02-06 10:45:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:45:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2025-02-06 10:45:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:16,109 INFO L225 Difference]: With dead ends: 386 [2025-02-06 10:45:16,110 INFO L226 Difference]: Without dead ends: 386 [2025-02-06 10:45:16,111 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-06 10:45:16,112 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:16,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-06 10:45:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-02-06 10:45:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7) internal successors, (510), 385 states have internal predecessors, (510), 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-06 10:45:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2025-02-06 10:45:16,120 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 89 [2025-02-06 10:45:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:16,121 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2025-02-06 10:45:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-06 10:45:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2025-02-06 10:45:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:45:16,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:16,124 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, 1] [2025-02-06 10:45:16,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:45:16,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:45:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 135581703, now seen corresponding path program 1 times [2025-02-06 10:45:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58466765] [2025-02-06 10:45:16,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:19,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:45:19,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:45:19,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:19,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:20,460 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-06 10:45:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58466765] [2025-02-06 10:45:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58466765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:45:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4901536] [2025-02-06 10:45:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:45:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:20,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:45:20,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:45:20,463 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-06 10:45:25,504 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-06 10:45:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:33,173 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2025-02-06 10:45:33,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:45:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2025-02-06 10:45:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:33,175 INFO L225 Difference]: With dead ends: 385 [2025-02-06 10:45:33,175 INFO L226 Difference]: Without dead ends: 385 [2025-02-06 10:45:33,175 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-06 10:45:33,175 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 295 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:33,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 510 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 717 Invalid, 1 Unknown, 0 Unchecked, 12.6s Time] [2025-02-06 10:45:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-06 10:45:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-02-06 10:45:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 300 states have (on average 1.6966666666666668) internal successors, (509), 384 states have internal predecessors, (509), 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-06 10:45:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2025-02-06 10:45:33,183 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 89 [2025-02-06 10:45:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:33,183 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2025-02-06 10:45:33,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-06 10:45:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2025-02-06 10:45:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:45:33,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:33,185 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, 1] [2025-02-06 10:45:33,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:45:33,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2025-02-06 10:45:33,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 135581704, now seen corresponding path program 1 times [2025-02-06 10:45:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:33,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374920788] [2025-02-06 10:45:33,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:36,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:45:36,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:45:36,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:36,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:37,912 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-06 10:45:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374920788] [2025-02-06 10:45:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374920788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:37,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:45:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698170844] [2025-02-06 10:45:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:45:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:37,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:45:37,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:45:37,913 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-06 10:45:43,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []