./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --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/memsafety-ext2/split_list_test05-2.i -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 db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:26:00,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:26:00,471 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:26:00,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:26:00,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:26:00,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:26:00,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:26:00,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:26:00,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:26:00,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:26:00,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:26:00,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:26:00,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:26:00,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:26:00,498 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:26:00,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:26:00,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:26:00,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:26:00,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:26:00,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:26:00,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:26:00,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:26:00,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:26:00,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:26:00,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:26:00,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:26:00,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:00,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:26:00,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:26:00,501 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2025-02-08 06:26:00,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:26:00,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:26:00,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:26:00,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:26:00,733 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:26:00,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2025-02-08 06:26:01,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/393e5cd26/c44d34b045cf4035bb028c23f85cd2c1/FLAG84c3e3f40 [2025-02-08 06:26:02,318 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:26:02,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2025-02-08 06:26:02,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/393e5cd26/c44d34b045cf4035bb028c23f85cd2c1/FLAG84c3e3f40 [2025-02-08 06:26:02,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/393e5cd26/c44d34b045cf4035bb028c23f85cd2c1 [2025-02-08 06:26:02,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:26:02,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:26:02,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:02,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:26:02,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:26:02,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e8f27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02, skipping insertion in model container [2025-02-08 06:26:02,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:26:02,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:02,617 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:26:02,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:02,691 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:26:02,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02 WrapperNode [2025-02-08 06:26:02,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:02,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:02,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:26:02,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:26:02,697 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:26:02" (1/1) ... [2025-02-08 06:26:02,705 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:26:02" (1/1) ... [2025-02-08 06:26:02,728 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 342 [2025-02-08 06:26:02,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:02,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:26:02,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:26:02,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:26:02,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,761 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [10, 2, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 11 writes are split as follows [5, 0, 6]. [2025-02-08 06:26:02,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:26:02,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:26:02,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:26:02,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:26:02,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (1/1) ... [2025-02-08 06:26:02,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:02,805 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:26:02,808 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:26:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:26:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:26:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:26:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:26:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:26:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:26:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:26:02,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:26:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-02-08 06:26:02,825 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-02-08 06:26:02,926 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:26:02,927 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem74#1.base, main_#t~mem74#1.offset;havoc main_#t~mem74#1.base, main_#t~mem74#1.offset; [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-1: SUMMARY for call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$#2(main_~cursor~0#1.base, 5 + main_~cursor~0#1.offset, 4); srcloc: null [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-1: assume !(1 == #valid[main_~cursor~0#1.base]); [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-1: assume !(4 + (5 + main_~cursor~0#1.offset) <= #length[main_~cursor~0#1.base] && 0 <= 5 + main_~cursor~0#1.offset); [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume 0 == main_~cursor~0#1.base || 1 == #valid[main_~cursor~0#1.base];call ULTIMATE.dealloc(main_~cursor~0#1.base, main_~cursor~0#1.offset);main_~cursor~0#1.base, main_~cursor~0#1.offset := main_~next~0#1.base, main_~next~0#1.offset; [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: assume !(0 == main_~cursor~0#1.base || 1 == #valid[main_~cursor~0#1.base]); [2025-02-08 06:26:03,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume main_~cursor~0#1.base < #StackHeapBarrier; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-1: assume !(main_~cursor~0#1.base < #StackHeapBarrier); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume 0 == main_~cursor~0#1.offset; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L615-2: assume !(0 == main_~cursor~0#1.offset); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc containsHead_#t~mem3#1;havoc containsHead_#t~mem4#1.base, containsHead_#t~mem4#1.offset;havoc containsHead_#t~mem5#1;havoc containsHead_#t~short6#1;havoc containsHead_#t~mem7#1.base, containsHead_#t~mem7#1.offset;havoc containsHead_#t~mem8#1.base, containsHead_#t~mem8#1.offset;havoc containsHead_#t~mem9#1;havoc containsHead_#t~short10#1;havoc containsHead_#t~mem11#1.base, containsHead_#t~mem11#1.offset;havoc containsHead_#t~mem12#1.base, containsHead_#t~mem12#1.offset;havoc containsHead_#t~mem13#1.base, containsHead_#t~mem13#1.offset;havoc containsHead_#t~mem14#1;havoc containsHead_#t~short15#1;havoc containsHead_#t~mem16#1.base, containsHead_#t~mem16#1.offset;havoc containsHead_#t~mem17#1.base, containsHead_#t~mem17#1.offset;havoc containsHead_#t~mem18#1.base, containsHead_#t~mem18#1.offset;havoc containsHead_#t~mem19#1.base, containsHead_#t~mem19#1.offset;havoc containsHead_#t~mem20#1;havoc containsHead_#t~short21#1;havoc containsHead_#t~mem22#1.base, containsHead_#t~mem22#1.offset;havoc containsHead_#t~mem23#1.base, containsHead_#t~mem23#1.offset;havoc containsHead_#t~mem24#1.base, containsHead_#t~mem24#1.offset;havoc containsHead_#t~mem25#1.base, containsHead_#t~mem25#1.offset;havoc containsHead_#t~mem26#1.base, containsHead_#t~mem26#1.offset;havoc containsHead_#t~mem27#1;havoc containsHead_#t~short28#1;main_#t~ret73#1 := containsHead_#res#1;havoc containsHead_#t~mem3#1, containsHead_#t~mem4#1.base, containsHead_#t~mem4#1.offset, containsHead_#t~mem5#1, containsHead_#t~short6#1, containsHead_#t~mem7#1.base, containsHead_#t~mem7#1.offset, containsHead_#t~mem8#1.base, containsHead_#t~mem8#1.offset, containsHead_#t~mem9#1, containsHead_#t~short10#1, containsHead_#t~mem11#1.base, containsHead_#t~mem11#1.offset, containsHead_#t~mem12#1.base, containsHead_#t~mem12#1.offset, containsHead_#t~mem13#1.base, containsHead_#t~mem13#1.offset, containsHead_#t~mem14#1, containsHead_#t~short15#1, containsHead_#t~mem16#1.base, containsHead_#t~mem16#1.offset, containsHead_#t~mem17#1.base, containsHead_#t~mem17#1.offset, containsHead_#t~mem18#1.base, containsHead_#t~mem18#1.offset, containsHead_#t~mem19#1.base, containsHead_#t~mem19#1.offset, containsHead_#t~mem20#1, containsHead_#t~short21#1, containsHead_#t~mem22#1.base, containsHead_#t~mem22#1.offset, containsHead_#t~mem23#1.base, containsHead_#t~mem23#1.offset, containsHead_#t~mem24#1.base, containsHead_#t~mem24#1.offset, containsHead_#t~mem25#1.base, containsHead_#t~mem25#1.offset, containsHead_#t~mem26#1.base, containsHead_#t~mem26#1.offset, containsHead_#t~mem27#1, containsHead_#t~short28#1, containsHead_~cursor#1.base, containsHead_~cursor#1.offset;havoc containsHead_#in~cursor#1.base, containsHead_#in~cursor#1.offset;assume { :end_inline_containsHead } true;assume -2147483648 <= main_#t~ret73#1 && main_#t~ret73#1 <= 2147483647; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L555: havoc containsBody_#t~mem29#1;havoc containsBody_#t~mem30#1.base, containsBody_#t~mem30#1.offset;havoc containsBody_#t~mem31#1;havoc containsBody_#t~short32#1;havoc containsBody_#t~mem33#1.base, containsBody_#t~mem33#1.offset;havoc containsBody_#t~mem34#1.base, containsBody_#t~mem34#1.offset;havoc containsBody_#t~mem35#1;havoc containsBody_#t~short36#1;havoc containsBody_#t~mem37#1.base, containsBody_#t~mem37#1.offset;havoc containsBody_#t~mem38#1.base, containsBody_#t~mem38#1.offset;havoc containsBody_#t~mem39#1.base, containsBody_#t~mem39#1.offset;havoc containsBody_#t~mem40#1;havoc containsBody_#t~short41#1;havoc containsBody_#t~mem42#1.base, containsBody_#t~mem42#1.offset;havoc containsBody_#t~mem43#1.base, containsBody_#t~mem43#1.offset;havoc containsBody_#t~mem44#1.base, containsBody_#t~mem44#1.offset;havoc containsBody_#t~mem45#1.base, containsBody_#t~mem45#1.offset;havoc containsBody_#t~mem46#1;havoc containsBody_#t~short47#1;havoc containsBody_#t~mem48#1.base, containsBody_#t~mem48#1.offset;havoc containsBody_#t~mem49#1.base, containsBody_#t~mem49#1.offset;havoc containsBody_#t~mem50#1.base, containsBody_#t~mem50#1.offset;havoc containsBody_#t~mem51#1.base, containsBody_#t~mem51#1.offset;havoc containsBody_#t~mem52#1.base, containsBody_#t~mem52#1.offset;havoc containsBody_#t~mem53#1;havoc containsBody_#t~short54#1;main_#t~ret77#1 := containsBody_#res#1;havoc containsBody_#t~mem29#1, containsBody_#t~mem30#1.base, containsBody_#t~mem30#1.offset, containsBody_#t~mem31#1, containsBody_#t~short32#1, containsBody_#t~mem33#1.base, containsBody_#t~mem33#1.offset, containsBody_#t~mem34#1.base, containsBody_#t~mem34#1.offset, containsBody_#t~mem35#1, containsBody_#t~short36#1, containsBody_#t~mem37#1.base, containsBody_#t~mem37#1.offset, containsBody_#t~mem38#1.base, containsBody_#t~mem38#1.offset, containsBody_#t~mem39#1.base, containsBody_#t~mem39#1.offset, containsBody_#t~mem40#1, containsBody_#t~short41#1, containsBody_#t~mem42#1.base, containsBody_#t~mem42#1.offset, containsBody_#t~mem43#1.base, containsBody_#t~mem43#1.offset, containsBody_#t~mem44#1.base, containsBody_#t~mem44#1.offset, containsBody_#t~mem45#1.base, containsBody_#t~mem45#1.offset, containsBody_#t~mem46#1, containsBody_#t~short47#1, containsBody_#t~mem48#1.base, containsBody_#t~mem48#1.offset, containsBody_#t~mem49#1.base, containsBody_#t~mem49#1.offset, containsBody_#t~mem50#1.base, containsBody_#t~mem50#1.offset, containsBody_#t~mem51#1.base, containsBody_#t~mem51#1.offset, containsBody_#t~mem52#1.base, containsBody_#t~mem52#1.offset, containsBody_#t~mem53#1, containsBody_#t~short54#1, containsBody_~cursor#1.base, containsBody_~cursor#1.offset;havoc containsBody_#in~cursor#1.base, containsBody_#in~cursor#1.offset;assume { :end_inline_containsBody } true;assume -2147483648 <= main_#t~ret77#1 && main_#t~ret77#1 <= 2147483647; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624-1: assume 0 == main_#t~ret77#1;havoc main_#t~ret77#1; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624-1: assume !(0 == main_#t~ret77#1);havoc main_#t~ret77#1; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~mem78#1.base, main_#t~mem78#1.offset; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: SUMMARY for call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$#2(main_~cursor~0#1.base, 5 + main_~cursor~0#1.offset, 4); srcloc: null [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume !(1 == #valid[main_~cursor~0#1.base]); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L625-1: assume !(4 + (5 + main_~cursor~0#1.offset) <= #length[main_~cursor~0#1.base] && 0 <= 5 + main_~cursor~0#1.offset); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: assume 0 == main_~cursor~0#1.base || 1 == #valid[main_~cursor~0#1.base];call ULTIMATE.dealloc(main_~cursor~0#1.base, main_~cursor~0#1.offset);main_~cursor~0#1.base, main_~cursor~0#1.offset := main_~next~0#1.base, main_~next~0#1.offset; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: assume !(0 == main_~cursor~0#1.base || 1 == #valid[main_~cursor~0#1.base]); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L626-1: assume main_~cursor~0#1.base < #StackHeapBarrier; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L626-1: assume !(main_~cursor~0#1.base < #StackHeapBarrier); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L626-2: assume 0 == main_~cursor~0#1.offset; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L626-2: assume !(0 == main_~cursor~0#1.offset); [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-1: assume 0 == main_#t~ret73#1;havoc main_#t~ret73#1; [2025-02-08 06:26:03,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-1: assume !(0 == main_#t~ret73#1);havoc main_#t~ret73#1; [2025-02-08 06:26:03,432 INFO L? ?]: Removed 345 outVars from TransFormulas that were not future-live. [2025-02-08 06:26:03,433 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:26:03,444 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:26:03,444 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:26:03,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:03 BoogieIcfgContainer [2025-02-08 06:26:03,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:26:03,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:26:03,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:26:03,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:26:03,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:26:02" (1/3) ... [2025-02-08 06:26:03,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a3579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:03, skipping insertion in model container [2025-02-08 06:26:03,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:02" (2/3) ... [2025-02-08 06:26:03,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a3579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:03, skipping insertion in model container [2025-02-08 06:26:03,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:03" (3/3) ... [2025-02-08 06:26:03,453 INFO L128 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2025-02-08 06:26:03,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:26:03,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG split_list_test05-2.i that has 2 procedures, 298 locations, 1 initial locations, 11 loop locations, and 147 error locations. [2025-02-08 06:26:03,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:26:03,515 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;@262977da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:26:03,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-02-08 06:26:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 142 states have (on average 2.147887323943662) internal successors, (305), 283 states have internal predecessors, (305), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:26:03,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:03,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:26:03,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash 10463, now seen corresponding path program 1 times [2025-02-08 06:26:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:03,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478405177] [2025-02-08 06:26:03,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:03,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:03,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:26:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:26:03,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:03,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:03,680 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:26:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478405177] [2025-02-08 06:26:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478405177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:26:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013425457] [2025-02-08 06:26:03,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:03,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:03,706 INFO L87 Difference]: Start difference. First operand has 298 states, 142 states have (on average 2.147887323943662) internal successors, (305), 283 states have internal predecessors, (305), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:26:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:03,858 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2025-02-08 06:26:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 06:26:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:03,863 INFO L225 Difference]: With dead ends: 173 [2025-02-08 06:26:03,864 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 06:26:03,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:26:03,866 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 96 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:03,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 216 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 06:26:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-02-08 06:26:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 77 states have (on average 2.103896103896104) internal successors, (162), 152 states have internal predecessors, (162), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2025-02-08 06:26:03,899 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 2 [2025-02-08 06:26:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:03,900 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2025-02-08 06:26:03,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:26:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2025-02-08 06:26:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:26:03,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:03,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:26:03,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:26:03,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:03,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash 10464, now seen corresponding path program 1 times [2025-02-08 06:26:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769998359] [2025-02-08 06:26:03,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:03,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:26:03,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:26:03,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:03,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:03,956 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:26:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769998359] [2025-02-08 06:26:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769998359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:26:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450859598] [2025-02-08 06:26:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:03,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:03,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:03,958 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:26:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:04,049 INFO L93 Difference]: Finished difference Result 168 states and 195 transitions. [2025-02-08 06:26:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:04,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 06:26:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:04,050 INFO L225 Difference]: With dead ends: 168 [2025-02-08 06:26:04,050 INFO L226 Difference]: Without dead ends: 168 [2025-02-08 06:26:04,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:26:04,051 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:04,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 299 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-08 06:26:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2025-02-08 06:26:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 77 states have (on average 2.0779220779220777) internal successors, (160), 150 states have internal predecessors, (160), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2025-02-08 06:26:04,061 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 2 [2025-02-08 06:26:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:04,061 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2025-02-08 06:26:04,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:26:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2025-02-08 06:26:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:26:04,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:04,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:04,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:26:04,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1698502330, now seen corresponding path program 1 times [2025-02-08 06:26:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852625178] [2025-02-08 06:26:04,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:04,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:26:04,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:26:04,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:04,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:04,118 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:26:04,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852625178] [2025-02-08 06:26:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852625178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:04,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:26:04,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326924534] [2025-02-08 06:26:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:04,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:04,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:04,120 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:04,221 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2025-02-08 06:26:04,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:04,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:26:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:04,223 INFO L225 Difference]: With dead ends: 160 [2025-02-08 06:26:04,223 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 06:26:04,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:26:04,223 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 35 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:04,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 253 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 06:26:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 06:26:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 77 states have (on average 2.012987012987013) internal successors, (155), 145 states have internal predecessors, (155), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2025-02-08 06:26:04,237 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 9 [2025-02-08 06:26:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:04,237 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2025-02-08 06:26:04,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2025-02-08 06:26:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:26:04,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:04,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:26:04,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1698502331, now seen corresponding path program 1 times [2025-02-08 06:26:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636754971] [2025-02-08 06:26:04,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:26:04,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:26:04,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:04,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:04,356 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:26:04,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:04,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636754971] [2025-02-08 06:26:04,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636754971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:04,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:04,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:26:04,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446452216] [2025-02-08 06:26:04,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:04,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:04,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:04,357 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:04,433 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2025-02-08 06:26:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:26:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:04,434 INFO L225 Difference]: With dead ends: 155 [2025-02-08 06:26:04,434 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 06:26:04,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:26:04,435 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 35 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:04,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 253 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 06:26:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-08 06:26:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 77 states have (on average 1.948051948051948) internal successors, (150), 140 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2025-02-08 06:26:04,441 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 9 [2025-02-08 06:26:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:04,442 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2025-02-08 06:26:04,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2025-02-08 06:26:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:26:04,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:04,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:26:04,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:04,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1113964988, now seen corresponding path program 1 times [2025-02-08 06:26:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140186676] [2025-02-08 06:26:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:26:04,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:26:04,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:04,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:04,558 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:26:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140186676] [2025-02-08 06:26:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140186676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:04,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:26:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693306704] [2025-02-08 06:26:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:04,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:26:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:04,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:26:04,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:04,560 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:04,782 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2025-02-08 06:26:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:26:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:26:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:04,786 INFO L225 Difference]: With dead ends: 147 [2025-02-08 06:26:04,786 INFO L226 Difference]: Without dead ends: 147 [2025-02-08 06:26:04,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:26:04,787 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 152 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:04,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 286 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:26:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-08 06:26:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-08 06:26:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 77 states have (on average 1.844155844155844) internal successors, (142), 132 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2025-02-08 06:26:04,792 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 10 [2025-02-08 06:26:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:04,792 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2025-02-08 06:26:04,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2025-02-08 06:26:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:26:04,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:04,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:04,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:26:04,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:04,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1113964989, now seen corresponding path program 1 times [2025-02-08 06:26:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:04,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092905228] [2025-02-08 06:26:04,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:04,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:26:04,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:26:04,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:04,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:04,946 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:26:04,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092905228] [2025-02-08 06:26:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092905228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:04,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:04,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:26:04,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29788337] [2025-02-08 06:26:04,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:04,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:26:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:04,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:26:04,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:04,947 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:05,178 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2025-02-08 06:26:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:26:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:26:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:05,179 INFO L225 Difference]: With dead ends: 139 [2025-02-08 06:26:05,180 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 06:26:05,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:26:05,185 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 248 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:05,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 155 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:26:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 06:26:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-08 06:26:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 124 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 06:26:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 164 transitions. [2025-02-08 06:26:05,190 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 164 transitions. Word has length 10 [2025-02-08 06:26:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:05,190 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 164 transitions. [2025-02-08 06:26:05,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2025-02-08 06:26:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:26:05,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:05,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:26:05,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:05,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:05,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1263355734, now seen corresponding path program 1 times [2025-02-08 06:26:05,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:05,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578760038] [2025-02-08 06:26:05,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:26:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:26:05,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:05,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:05,515 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:26:05,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:05,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578760038] [2025-02-08 06:26:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578760038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:26:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297129118] [2025-02-08 06:26:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:05,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:26:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:05,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:26:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:26:05,517 INFO L87 Difference]: Start difference. First operand 139 states and 164 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:05,620 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2025-02-08 06:26:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:26:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:26:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:05,621 INFO L225 Difference]: With dead ends: 161 [2025-02-08 06:26:05,621 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 06:26:05,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:26:05,622 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 35 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:05,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 893 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 06:26:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2025-02-08 06:26:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 131 states have internal predecessors, (142), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2025-02-08 06:26:05,628 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 19 [2025-02-08 06:26:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:05,628 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2025-02-08 06:26:05,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2025-02-08 06:26:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:26:05,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:05,629 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] [2025-02-08 06:26:05,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:26:05,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:05,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1631565676, now seen corresponding path program 1 times [2025-02-08 06:26:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875978693] [2025-02-08 06:26:05,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:05,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:26:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:26:05,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:05,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:05,888 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:26:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875978693] [2025-02-08 06:26:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875978693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:05,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:26:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001501174] [2025-02-08 06:26:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:05,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:26:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:05,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:26:05,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:26:05,890 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:06,033 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2025-02-08 06:26:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:26:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:26:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:06,034 INFO L225 Difference]: With dead ends: 152 [2025-02-08 06:26:06,034 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 06:26:06,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:26:06,035 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 117 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:06,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 907 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 06:26:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2025-02-08 06:26:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 87 states have (on average 1.6666666666666667) internal successors, (145), 134 states have internal predecessors, (145), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2025-02-08 06:26:06,040 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 21 [2025-02-08 06:26:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:06,040 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2025-02-08 06:26:06,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2025-02-08 06:26:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:26:06,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:06,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 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:26:06,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:26:06,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:06,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -687567878, now seen corresponding path program 1 times [2025-02-08 06:26:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329045743] [2025-02-08 06:26:06,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:06,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:26:06,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:26:06,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:06,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329045743] [2025-02-08 06:26:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329045743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061664589] [2025-02-08 06:26:06,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:06,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:06,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:06,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:26:06,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:26:06,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:26:06,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:06,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 06:26:06,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:06,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:26:06,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:26:06,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-02-08 06:26:06,793 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-02-08 06:26:06,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2025-02-08 06:26:06,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:06,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2025-02-08 06:26:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:07,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2025-02-08 06:26:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061664589] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:07,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:07,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2025-02-08 06:26:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427112303] [2025-02-08 06:26:07,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:07,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:26:07,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:07,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:26:07,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:26:07,714 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand has 23 states, 22 states have (on average 4.136363636363637) internal successors, (91), 22 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:26:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:08,955 INFO L93 Difference]: Finished difference Result 286 states and 367 transitions. [2025-02-08 06:26:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:26:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.136363636363637) internal successors, (91), 22 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-08 06:26:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:08,958 INFO L225 Difference]: With dead ends: 286 [2025-02-08 06:26:08,958 INFO L226 Difference]: Without dead ends: 286 [2025-02-08 06:26:08,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 06:26:08,959 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 793 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:08,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1193 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:26:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-08 06:26:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 155. [2025-02-08 06:26:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 139 states have internal predecessors, (149), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2025-02-08 06:26:08,968 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 36 [2025-02-08 06:26:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:08,968 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2025-02-08 06:26:08,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.136363636363637) internal successors, (91), 22 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:26:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2025-02-08 06:26:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:26:08,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:08,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 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:26:08,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:09,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash -687567877, now seen corresponding path program 1 times [2025-02-08 06:26:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021498399] [2025-02-08 06:26:09,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:09,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:26:09,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:26:09,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:09,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021498399] [2025-02-08 06:26:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021498399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806694510] [2025-02-08 06:26:10,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:10,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:10,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:26:10,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:26:10,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:26:10,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:10,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:10,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:26:10,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:10,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:26:10,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:26:10,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:26:10,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-02-08 06:26:10,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:26:10,594 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-02-08 06:26:10,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-08 06:26:10,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 06:26:10,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2025-02-08 06:26:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:10,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:10,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-02-08 06:26:11,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2025-02-08 06:26:11,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2025-02-08 06:26:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:11,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:11,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:11,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:11,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:11,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:12,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:26:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806694510] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:12,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:12,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 6] total 29 [2025-02-08 06:26:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471650608] [2025-02-08 06:26:12,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:12,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 06:26:12,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:12,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 06:26:12,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:26:12,181 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:26:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:14,706 INFO L93 Difference]: Finished difference Result 302 states and 385 transitions. [2025-02-08 06:26:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 06:26:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-08 06:26:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:14,709 INFO L225 Difference]: With dead ends: 302 [2025-02-08 06:26:14,709 INFO L226 Difference]: Without dead ends: 302 [2025-02-08 06:26:14,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=598, Invalid=2824, Unknown=0, NotChecked=0, Total=3422 [2025-02-08 06:26:14,710 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 622 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 2551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:14,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 856 Invalid, 2551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 06:26:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-08 06:26:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 154. [2025-02-08 06:26:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 92 states have (on average 1.608695652173913) internal successors, (148), 138 states have internal predecessors, (148), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2025-02-08 06:26:14,722 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 36 [2025-02-08 06:26:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:14,722 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2025-02-08 06:26:14,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:26:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2025-02-08 06:26:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-08 06:26:14,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:14,731 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:14,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:26:14,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:14,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1842196085, now seen corresponding path program 1 times [2025-02-08 06:26:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116322246] [2025-02-08 06:26:14,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:14,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 06:26:15,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 06:26:15,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:15,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2025-02-08 06:26:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116322246] [2025-02-08 06:26:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116322246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823578030] [2025-02-08 06:26:15,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:15,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:15,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:15,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:15,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:26:15,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 06:26:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 06:26:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:15,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 2104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 06:26:15,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2025-02-08 06:26:15,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:26:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823578030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:15,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:26:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-02-08 06:26:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952875704] [2025-02-08 06:26:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:15,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:15,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:15,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:15,468 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 06:26:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:15,478 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2025-02-08 06:26:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 216 [2025-02-08 06:26:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:15,480 INFO L225 Difference]: With dead ends: 155 [2025-02-08 06:26:15,480 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 06:26:15,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 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:26:15,480 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:15,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 06:26:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-08 06:26:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 93 states have (on average 1.6021505376344085) internal successors, (149), 139 states have internal predecessors, (149), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2025-02-08 06:26:15,486 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 216 [2025-02-08 06:26:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:15,487 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2025-02-08 06:26:15,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-08 06:26:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2025-02-08 06:26:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-08 06:26:15,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:15,491 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:15,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:15,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2035820533, now seen corresponding path program 1 times [2025-02-08 06:26:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134812612] [2025-02-08 06:26:15,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-08 06:26:15,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-08 06:26:15,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:15,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 1 proven. 364 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-02-08 06:26:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134812612] [2025-02-08 06:26:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134812612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689437725] [2025-02-08 06:26:16,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:16,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:16,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:26:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-08 06:26:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-08 06:26:17,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:17,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:17,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:26:17,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:17,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:26:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 521 proven. 13 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-02-08 06:26:17,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:17,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-02-08 06:26:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 325 proven. 40 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-02-08 06:26:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689437725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:17,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 21 [2025-02-08 06:26:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481310496] [2025-02-08 06:26:17,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:26:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:17,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:26:17,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:26:17,500 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 21 states, 20 states have (on average 5.0) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-08 06:26:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:18,005 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2025-02-08 06:26:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:26:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 244 [2025-02-08 06:26:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:18,012 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:26:18,012 INFO L226 Difference]: Without dead ends: 148 [2025-02-08 06:26:18,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:26:18,013 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 271 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:18,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1401 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:26:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-08 06:26:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-08 06:26:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.627906976744186) internal successors, (140), 132 states have internal predecessors, (140), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2025-02-08 06:26:18,021 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 244 [2025-02-08 06:26:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:18,022 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2025-02-08 06:26:18,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 18 states have internal predecessors, (100), 4 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-08 06:26:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2025-02-08 06:26:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-08 06:26:18,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:18,023 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:18,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 06:26:18,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:18,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash -131420693, now seen corresponding path program 1 times [2025-02-08 06:26:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062258143] [2025-02-08 06:26:18,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:18,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-08 06:26:18,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-08 06:26:18,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:18,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 237 proven. 702 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-02-08 06:26:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062258143] [2025-02-08 06:26:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062258143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393593726] [2025-02-08 06:26:26,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:26,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:26,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:26,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:26:26,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-08 06:26:27,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-08 06:26:27,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:27,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:27,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 2356 conjuncts, 290 conjuncts are in the unsatisfiable core [2025-02-08 06:26:27,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:27,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:26:27,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2025-02-08 06:26:27,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:27,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 16 [2025-02-08 06:26:27,733 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:27,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:27,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-02-08 06:26:27,872 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:27,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:27,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:27,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2025-02-08 06:26:27,980 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-02-08 06:26:27,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2025-02-08 06:26:27,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 17 [2025-02-08 06:26:28,219 INFO L349 Elim1Store]: treesize reduction 135, result has 22.9 percent of original size [2025-02-08 06:26:28,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 49 [2025-02-08 06:26:28,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:28,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 38 [2025-02-08 06:26:28,362 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:28,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:28,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:28,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2025-02-08 06:26:28,484 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:28,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2025-02-08 06:26:28,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:28,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2025-02-08 06:26:28,803 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:28,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2025-02-08 06:26:28,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:28,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2025-02-08 06:26:28,966 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:28,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 71 [2025-02-08 06:26:28,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-08 06:26:29,113 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:29,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 71 [2025-02-08 06:26:29,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-08 06:26:29,268 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:29,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 71 [2025-02-08 06:26:29,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-08 06:26:29,418 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:29,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 71 [2025-02-08 06:26:29,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-08 06:26:29,562 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:29,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 71 [2025-02-08 06:26:29,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-08 06:26:29,825 INFO L349 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2025-02-08 06:26:29,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2025-02-08 06:26:29,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-08 06:26:29,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2025-02-08 06:26:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 409 proven. 715 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-02-08 06:26:29,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393593726] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:32,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:32,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 36] total 44 [2025-02-08 06:26:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901770569] [2025-02-08 06:26:32,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:32,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 06:26:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:32,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 06:26:32,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=2881, Unknown=0, NotChecked=0, Total=3306 [2025-02-08 06:26:32,595 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 45 states, 44 states have (on average 3.5) internal successors, (154), 43 states have internal predecessors, (154), 7 states have call successors, (28), 3 states have call predecessors, (28), 12 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2025-02-08 06:26:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:33,678 INFO L93 Difference]: Finished difference Result 167 states and 195 transitions. [2025-02-08 06:26:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:26:33,679 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.5) internal successors, (154), 43 states have internal predecessors, (154), 7 states have call successors, (28), 3 states have call predecessors, (28), 12 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 272 [2025-02-08 06:26:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:33,680 INFO L225 Difference]: With dead ends: 167 [2025-02-08 06:26:33,680 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 06:26:33,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 414 SyntacticMatches, 22 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2656 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=760, Invalid=4496, Unknown=0, NotChecked=0, Total=5256 [2025-02-08 06:26:33,682 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 395 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:33,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1268 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 06:26:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 06:26:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2025-02-08 06:26:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 131 states have internal predecessors, (139), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2025-02-08 06:26:33,685 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 272 [2025-02-08 06:26:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:33,686 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2025-02-08 06:26:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.5) internal successors, (154), 43 states have internal predecessors, (154), 7 states have call successors, (28), 3 states have call predecessors, (28), 12 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2025-02-08 06:26:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2025-02-08 06:26:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-08 06:26:33,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:33,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:33,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:26:33,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 06:26:33,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:33,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash -131420692, now seen corresponding path program 1 times [2025-02-08 06:26:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:33,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254801721] [2025-02-08 06:26:33,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:33,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-08 06:26:34,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-08 06:26:34,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:34,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 141 proven. 758 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-02-08 06:26:45,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254801721] [2025-02-08 06:26:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254801721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249519494] [2025-02-08 06:26:45,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:45,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:45,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:45,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:45,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:26:45,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-08 06:26:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-08 06:26:45,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:45,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:45,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 2356 conjuncts, 376 conjuncts are in the unsatisfiable core [2025-02-08 06:26:45,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:45,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:26:45,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:26:45,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:26:46,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:26:46,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 06:26:46,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-02-08 06:26:46,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:46,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2025-02-08 06:26:46,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:46,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2025-02-08 06:26:46,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2025-02-08 06:26:46,479 INFO L349 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2025-02-08 06:26:46,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-02-08 06:26:46,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:46,717 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:46,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:46,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:26:46,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 32 [2025-02-08 06:26:46,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:46,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:26:46,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 22 [2025-02-08 06:26:46,912 INFO L349 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2025-02-08 06:26:46,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-02-08 06:26:46,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:47,144 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:47,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2025-02-08 06:26:47,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 27 [2025-02-08 06:26:47,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:47,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2025-02-08 06:26:47,487 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:47,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-08 06:26:47,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2025-02-08 06:26:47,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2025-02-08 06:26:47,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2025-02-08 06:26:47,728 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:47,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2025-02-08 06:26:48,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2025-02-08 06:26:48,223 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-02-08 06:26:48,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2025-02-08 06:26:48,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2025-02-08 06:26:48,542 INFO L349 Elim1Store]: treesize reduction 92, result has 54.5 percent of original size [2025-02-08 06:26:48,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 119 [2025-02-08 06:26:48,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 62 [2025-02-08 06:26:48,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:49,019 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2025-02-08 06:26:49,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2025-02-08 06:26:49,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:49,037 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:26:49,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2025-02-08 06:26:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:49,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:49,355 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2025-02-08 06:26:49,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2025-02-08 06:26:49,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:49,370 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:26:49,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2025-02-08 06:26:49,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:49,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:49,694 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2025-02-08 06:26:49,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2025-02-08 06:26:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:49,709 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:26:49,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2025-02-08 06:26:49,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:49,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:50,051 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2025-02-08 06:26:50,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2025-02-08 06:26:50,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:50,071 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:26:50,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2025-02-08 06:26:50,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:50,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:26:50,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:50,445 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2025-02-08 06:26:50,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2025-02-08 06:26:50,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 46 [2025-02-08 06:26:50,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:50,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:50,876 INFO L349 Elim1Store]: treesize reduction 51, result has 31.1 percent of original size [2025-02-08 06:26:50,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2025-02-08 06:26:50,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2025-02-08 06:26:50,886 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-02-08 06:26:50,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-08 06:26:50,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-02-08 06:26:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 239 proven. 1136 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-08 06:26:51,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249519494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:51,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 44] total 59 [2025-02-08 06:26:51,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921981454] [2025-02-08 06:26:51,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:51,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-08 06:26:51,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:51,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-08 06:26:51,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3766, Unknown=4, NotChecked=0, Total=4032 [2025-02-08 06:26:51,386 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand has 60 states, 55 states have (on average 4.054545454545455) internal successors, (223), 54 states have internal predecessors, (223), 12 states have call successors, (29), 3 states have call predecessors, (29), 16 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2025-02-08 06:26:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:53,965 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2025-02-08 06:26:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:26:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 55 states have (on average 4.054545454545455) internal successors, (223), 54 states have internal predecessors, (223), 12 states have call successors, (29), 3 states have call predecessors, (29), 16 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) Word has length 272 [2025-02-08 06:26:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:53,967 INFO L225 Difference]: With dead ends: 166 [2025-02-08 06:26:53,967 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 06:26:53,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 276 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=562, Invalid=5596, Unknown=4, NotChecked=0, Total=6162 [2025-02-08 06:26:53,968 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 742 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:53,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1434 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 06:26:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 06:26:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2025-02-08 06:26:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 86 states have (on average 1.6046511627906976) internal successors, (138), 130 states have internal predecessors, (138), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2025-02-08 06:26:53,974 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 272 [2025-02-08 06:26:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:53,975 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2025-02-08 06:26:53,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 55 states have (on average 4.054545454545455) internal successors, (223), 54 states have internal predecessors, (223), 12 states have call successors, (29), 3 states have call predecessors, (29), 16 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2025-02-08 06:26:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2025-02-08 06:26:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-08 06:26:53,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:53,978 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:53,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:26:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 06:26:54,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1856523210, now seen corresponding path program 1 times [2025-02-08 06:26:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653555035] [2025-02-08 06:26:54,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:54,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 06:26:54,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 06:26:54,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:54,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-08 06:26:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653555035] [2025-02-08 06:26:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653555035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:54,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:26:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991994576] [2025-02-08 06:26:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:26:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:54,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:26:54,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:26:54,482 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-08 06:26:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:54,550 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2025-02-08 06:26:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:26:54,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 275 [2025-02-08 06:26:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:54,551 INFO L225 Difference]: With dead ends: 140 [2025-02-08 06:26:54,551 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 06:26:54,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:26:54,554 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 53 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:54,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 277 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 06:26:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-08 06:26:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 124 states have internal predecessors, (132), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:26:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2025-02-08 06:26:54,561 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 275 [2025-02-08 06:26:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:54,561 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2025-02-08 06:26:54,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-08 06:26:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2025-02-08 06:26:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-08 06:26:54,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:54,564 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:26:54,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:26:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1856523211, now seen corresponding path program 1 times [2025-02-08 06:26:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323849965] [2025-02-08 06:26:54,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:54,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 06:26:54,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 06:26:54,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:54,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 1456 trivial. 0 not checked. [2025-02-08 06:26:59,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323849965] [2025-02-08 06:26:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323849965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334463022] [2025-02-08 06:26:59,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:59,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:59,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:59,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:59,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:26:59,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 06:26:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 06:26:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:59,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 2376 conjuncts, 253 conjuncts are in the unsatisfiable core [2025-02-08 06:26:59,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:59,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:26:59,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-02-08 06:27:00,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:27:00,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2025-02-08 06:27:00,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:00,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:00,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:01,067 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_~head.offset_171 Int)) (let ((.cse0 (+ v_append_~head.offset_171 4))) (and (= (store |c_old(#memory_$Pointer$#0.base)| |c_append_#in~head.base| (store (select |c_old(#memory_$Pointer$#0.base)| |c_append_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$#0.base| |c_append_#in~head.base|) .cse0))) |c_#memory_$Pointer$#0.base|) (<= |c_append_#in~head.offset| v_append_~head.offset_171) (= |c_#memory_$Pointer$#0.offset| (store |c_old(#memory_$Pointer$#0.offset)| |c_append_#in~head.base| (store (select |c_old(#memory_$Pointer$#0.offset)| |c_append_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_append_#in~head.base|) .cse0))))))) is different from true [2025-02-08 06:27:01,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:27:01,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:27:01,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:27:01,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:27:01,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:27:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 207 proven. 265 refuted. 0 times theorem prover too weak. 1068 trivial. 28 not checked. [2025-02-08 06:27:01,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:01,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 06:27:02,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2025-02-08 06:27:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 222 proven. 98 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2025-02-08 06:27:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334463022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:03,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 13] total 35 [2025-02-08 06:27:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014428701] [2025-02-08 06:27:03,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:27:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:03,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:27:03,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1043, Unknown=1, NotChecked=66, Total=1260 [2025-02-08 06:27:03,036 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 34 states have internal predecessors, (159), 4 states have call successors, (43), 5 states have call predecessors, (43), 9 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-02-08 06:27:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:03,605 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2025-02-08 06:27:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:27:03,605 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 34 states have internal predecessors, (159), 4 states have call successors, (43), 5 states have call predecessors, (43), 9 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) Word has length 275 [2025-02-08 06:27:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:03,606 INFO L225 Difference]: With dead ends: 134 [2025-02-08 06:27:03,606 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 06:27:03,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 551 SyntacticMatches, 30 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1785, Unknown=1, NotChecked=88, Total=2162 [2025-02-08 06:27:03,608 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 363 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:03,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 903 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 838 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2025-02-08 06:27:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 06:27:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-08 06:27:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 118 states have internal predecessors, (126), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:27:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2025-02-08 06:27:03,612 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 275 [2025-02-08 06:27:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:03,612 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2025-02-08 06:27:03,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.542857142857143) internal successors, (159), 34 states have internal predecessors, (159), 4 states have call successors, (43), 5 states have call predecessors, (43), 9 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-02-08 06:27:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2025-02-08 06:27:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-08 06:27:03,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:03,618 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:03,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:27:03,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:03,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-02-08 06:27:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 118223653, now seen corresponding path program 1 times [2025-02-08 06:27:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526361673] [2025-02-08 06:27:03,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:03,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-08 06:27:04,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-08 06:27:04,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:04,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat