./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.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/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.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 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:46:08,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:46:08,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:46:08,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:46:08,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:46:08,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:46:08,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:46:08,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:46:08,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:46:08,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:46:08,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:46:08,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:46:08,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:46:08,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:46:08,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:46:08,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:46:08,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:46:08,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:46:08,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:46:08,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:46:08,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:46:08,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:46:08,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:46:08,692 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 -> 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 [2025-02-08 06:46:08,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:46:08,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:46:08,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:46:08,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:46:08,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:46:08,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-02-08 06:46:10,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9082a0d/c0bb1157200549e7bedb22606959fd1b/FLAG57969a7f6 [2025-02-08 06:46:10,339 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:46:10,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-02-08 06:46:10,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9082a0d/c0bb1157200549e7bedb22606959fd1b/FLAG57969a7f6 [2025-02-08 06:46:10,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9082a0d/c0bb1157200549e7bedb22606959fd1b [2025-02-08 06:46:10,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:46:10,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:46:10,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:46:10,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:46:10,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:46:10,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:10,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10, skipping insertion in model container [2025-02-08 06:46:10,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:10,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:46:10,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:46:10,952 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:46:10,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:46:10,990 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:46:10,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10 WrapperNode [2025-02-08 06:46:10,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:46:10,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:46:10,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:46:10,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:46:10,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,025 INFO L138 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2025-02-08 06:46:11,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:46:11,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:46:11,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:46:11,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:46:11,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,046 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-02-08 06:46:11,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:46:11,064 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:46:11,064 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:46:11,064 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:46:11,065 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (1/1) ... [2025-02-08 06:46:11,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:46:11,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:11,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:46:11,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:46:11,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:46:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:46:11,193 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:46:11,194 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:46:11,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-02-08 06:46:11,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:46:11,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 06:46:11,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L77: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset);havoc parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset; [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: SUMMARY for call write~int#2(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); srcloc: null [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: assume !(1 == #valid[parse_expression_list_~#str2~0#1.base]); [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L78: assume !(1 + (parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1))) <= #length[parse_expression_list_~#str2~0#1.base] && 0 <= parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1))); [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:46:11,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:46:11,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:46:11,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;havoc r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 06:46:11,430 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-08 06:46:11,430 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:46:11,437 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:46:11,437 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:46:11,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:11 BoogieIcfgContainer [2025-02-08 06:46:11,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:46:11,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:46:11,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:46:11,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:46:11,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:46:10" (1/3) ... [2025-02-08 06:46:11,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e7f95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:46:11, skipping insertion in model container [2025-02-08 06:46:11,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:46:10" (2/3) ... [2025-02-08 06:46:11,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e7f95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:46:11, skipping insertion in model container [2025-02-08 06:46:11,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:11" (3/3) ... [2025-02-08 06:46:11,445 INFO L128 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-02-08 06:46:11,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:46:11,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i that has 1 procedures, 67 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-02-08 06:46:11,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:46:11,487 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;@5b63e39a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:46:11,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 06:46:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:11,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:11,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:11,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:11,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash 136841, now seen corresponding path program 1 times [2025-02-08 06:46:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:11,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205598134] [2025-02-08 06:46:11,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:11,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:11,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205598134] [2025-02-08 06:46:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205598134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:11,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:11,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:46:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028414830] [2025-02-08 06:46:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:11,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:46:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:11,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:46:11,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:46:11,674 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:11,697 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2025-02-08 06:46:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:46:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:46:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:11,703 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:46:11,703 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 06:46:11,704 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:46:11,706 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:11,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 06:46:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-02-08 06:46:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.75) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-02-08 06:46:11,729 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 3 [2025-02-08 06:46:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:11,730 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-02-08 06:46:11,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-02-08 06:46:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:11,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:11,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:11,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:46:11,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:11,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash 137001, now seen corresponding path program 1 times [2025-02-08 06:46:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:11,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238423541] [2025-02-08 06:46:11,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:11,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:11,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:11,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:11,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238423541] [2025-02-08 06:46:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238423541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:11,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:46:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831327369] [2025-02-08 06:46:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:46:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:46:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:46:11,769 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:11,809 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-02-08 06:46:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:46:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:46:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:11,810 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:46:11,810 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:46:11,810 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:46:11,811 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:11,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:46:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 06:46:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-02-08 06:46:11,815 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 3 [2025-02-08 06:46:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:11,815 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-02-08 06:46:11,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-02-08 06:46:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:46:11,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:11,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:46:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:46:11,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 137002, now seen corresponding path program 1 times [2025-02-08 06:46:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241874689] [2025-02-08 06:46:11,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:11,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:46:11,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:46:11,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:11,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:11,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241874689] [2025-02-08 06:46:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241874689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:11,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:46:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854379226] [2025-02-08 06:46:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:46:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:11,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:46:11,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:46:11,886 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:11,921 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-02-08 06:46:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:46:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:46:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:11,922 INFO L225 Difference]: With dead ends: 65 [2025-02-08 06:46:11,922 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 06:46:11,922 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:46:11,922 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:11,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 06:46:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-02-08 06:46:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-02-08 06:46:11,930 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 3 [2025-02-08 06:46:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-02-08 06:46:11,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2025-02-08 06:46:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:46:11,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:11,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:46:11,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:46:11,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:11,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash -213498050, now seen corresponding path program 1 times [2025-02-08 06:46:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:11,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830912713] [2025-02-08 06:46:11,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:11,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:11,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:46:11,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:46:11,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:11,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:46:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830912713] [2025-02-08 06:46:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830912713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:46:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849892349] [2025-02-08 06:46:12,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:12,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:46:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:12,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:46:12,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:46:12,031 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:12,057 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-02-08 06:46:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:46:12,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:46:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:12,058 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:46:12,058 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:46:12,058 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:46:12,058 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:12,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:46:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 06:46:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-02-08 06:46:12,061 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 6 [2025-02-08 06:46:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:12,062 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-02-08 06:46:12,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-02-08 06:46:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:46:12,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:12,062 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 06:46:12,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:46:12,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:12,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash -213497890, now seen corresponding path program 1 times [2025-02-08 06:46:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067278254] [2025-02-08 06:46:12,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:12,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:46:12,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:46:12,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:12,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067278254] [2025-02-08 06:46:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067278254] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037953007] [2025-02-08 06:46:12,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:12,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:12,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:12,157 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:46:12,158 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:46:12,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:46:12,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:46:12,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:12,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:46:12,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:12,240 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:46:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:12,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037953007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:12,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-08 06:46:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073444720] [2025-02-08 06:46:12,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:12,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:46:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:12,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:46:12,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:46:12,402 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:12,530 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2025-02-08 06:46:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:46:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 6 [2025-02-08 06:46:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:12,531 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:46:12,531 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:46:12,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:46:12,531 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:12,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 356 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:46:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 06:46:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.58) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-02-08 06:46:12,535 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 6 [2025-02-08 06:46:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-02-08 06:46:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-02-08 06:46:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:46:12,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:12,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:12,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:46:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:12,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -405439753, now seen corresponding path program 1 times [2025-02-08 06:46:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598460159] [2025-02-08 06:46:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:12,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:46:12,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:46:12,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:12,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:46:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:12,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598460159] [2025-02-08 06:46:12,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598460159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:12,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:12,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:46:12,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306427327] [2025-02-08 06:46:12,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:12,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:12,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:12,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:12,871 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:12,917 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-02-08 06:46:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:46:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:12,918 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:46:12,918 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:46:12,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:12,919 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 108 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:12,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:46:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 06:46:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.56) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-02-08 06:46:12,930 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 16 [2025-02-08 06:46:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-02-08 06:46:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-02-08 06:46:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:46:12,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:12,931 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:46:12,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash -405435943, now seen corresponding path program 1 times [2025-02-08 06:46:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282673360] [2025-02-08 06:46:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:12,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:46:12,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:46:12,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:12,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282673360] [2025-02-08 06:46:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282673360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932679040] [2025-02-08 06:46:13,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:13,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:13,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:13,057 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:46:13,067 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:46:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:46:13,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:46:13,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:13,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:46:13,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:13,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:46:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932679040] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:13,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 06:46:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549252414] [2025-02-08 06:46:13,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:13,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:46:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:13,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:46:13,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:46:13,182 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:13,216 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-02-08 06:46:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:46:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:46:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:13,217 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:46:13,217 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:46:13,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:46:13,217 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:13,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 332 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:46:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 06:46:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2025-02-08 06:46:13,221 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 16 [2025-02-08 06:46:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:13,221 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2025-02-08 06:46:13,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2025-02-08 06:46:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:46:13,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:13,222 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:13,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:46:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:13,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 115221669, now seen corresponding path program 2 times [2025-02-08 06:46:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648112975] [2025-02-08 06:46:13,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:13,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 06:46:13,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 31 statements. [2025-02-08 06:46:13,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:46:13,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648112975] [2025-02-08 06:46:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648112975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:13,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:13,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:46:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38576837] [2025-02-08 06:46:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:46:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:13,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:46:13,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:46:13,498 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:13,547 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-02-08 06:46:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:46:13,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 06:46:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:13,548 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:46:13,548 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 06:46:13,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:46:13,549 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 92 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:13,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 43 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 06:46:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 06:46:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-02-08 06:46:13,557 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 31 [2025-02-08 06:46:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:13,557 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-02-08 06:46:13,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-02-08 06:46:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:46:13,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:13,558 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:13,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:46:13,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:13,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash 115221670, now seen corresponding path program 1 times [2025-02-08 06:46:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507979789] [2025-02-08 06:46:13,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:46:13,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:46:13,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:13,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-08 06:46:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507979789] [2025-02-08 06:46:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507979789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:13,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:46:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965285803] [2025-02-08 06:46:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:13,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:46:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:13,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:46:13,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:13,855 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:13,953 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2025-02-08 06:46:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:46:13,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 31 [2025-02-08 06:46:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:13,954 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:46:13,954 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:46:13,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:13,955 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:13,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:46:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-02-08 06:46:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.295774647887324) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2025-02-08 06:46:13,957 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 31 [2025-02-08 06:46:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:13,959 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-02-08 06:46:13,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2025-02-08 06:46:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:46:13,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:13,960 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:13,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:46:13,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:13,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1818032353, now seen corresponding path program 1 times [2025-02-08 06:46:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461534768] [2025-02-08 06:46:13,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:13,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:46:13,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:46:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:14,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:14,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461534768] [2025-02-08 06:46:14,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461534768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:14,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:14,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:46:14,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506321187] [2025-02-08 06:46:14,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:14,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:46:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:14,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:46:14,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:14,110 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:14,197 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-02-08 06:46:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:46:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 35 [2025-02-08 06:46:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:14,199 INFO L225 Difference]: With dead ends: 107 [2025-02-08 06:46:14,199 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 06:46:14,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:46:14,199 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 75 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:14,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 197 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 06:46:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2025-02-08 06:46:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2025-02-08 06:46:14,205 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 35 [2025-02-08 06:46:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2025-02-08 06:46:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2025-02-08 06:46:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:46:14,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:14,208 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:14,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:46:14,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1424167431, now seen corresponding path program 1 times [2025-02-08 06:46:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836830577] [2025-02-08 06:46:14,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:14,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:46:14,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:46:14,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:14,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-08 06:46:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836830577] [2025-02-08 06:46:14,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836830577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028822765] [2025-02-08 06:46:14,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:14,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:14,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:14,476 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:46:14,477 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:46:14,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:46:14,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:46:14,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:14,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:14,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:46:14,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:14,558 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:46:14,568 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:46:14,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:14,733 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 14 treesize of output 9 [2025-02-08 06:46:14,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:46:14,750 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 11 treesize of output 11 [2025-02-08 06:46:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:14,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028822765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:15,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-08 06:46:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863996777] [2025-02-08 06:46:15,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:15,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:46:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:15,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:46:15,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:46:15,384 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:15,615 INFO L93 Difference]: Finished difference Result 192 states and 245 transitions. [2025-02-08 06:46:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:46:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 38 [2025-02-08 06:46:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:15,617 INFO L225 Difference]: With dead ends: 192 [2025-02-08 06:46:15,617 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 06:46:15,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:46:15,617 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 165 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:15,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 484 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:46:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 06:46:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 111. [2025-02-08 06:46:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 110 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2025-02-08 06:46:15,621 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 38 [2025-02-08 06:46:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:15,621 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2025-02-08 06:46:15,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2025-02-08 06:46:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:46:15,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:15,622 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:15,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:46:15,822 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:46:15,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1199461819, now seen corresponding path program 1 times [2025-02-08 06:46:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122391951] [2025-02-08 06:46:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:46:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:46:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122391951] [2025-02-08 06:46:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122391951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:15,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:15,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:46:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111920634] [2025-02-08 06:46:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:15,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:46:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:15,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:46:15,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:15,929 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:15,974 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2025-02-08 06:46:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:46:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 39 [2025-02-08 06:46:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:15,975 INFO L225 Difference]: With dead ends: 110 [2025-02-08 06:46:15,975 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 06:46:15,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:46:15,976 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:15,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 06:46:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-08 06:46:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 109 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2025-02-08 06:46:15,983 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 39 [2025-02-08 06:46:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2025-02-08 06:46:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2025-02-08 06:46:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:46:15,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:15,983 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:15,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:46:15,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:15,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1608436724, now seen corresponding path program 1 times [2025-02-08 06:46:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211575837] [2025-02-08 06:46:15,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:15,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:46:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:46:16,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-08 06:46:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211575837] [2025-02-08 06:46:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211575837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332807626] [2025-02-08 06:46:16,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:16,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:16,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:16,163 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:46:16,166 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:46:16,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:46:16,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:46:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:16,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 06:46:16,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:16,235 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:46:16,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:16,416 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 14 treesize of output 9 [2025-02-08 06:46:16,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:46:16,424 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 11 treesize of output 11 [2025-02-08 06:46:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:16,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:16,748 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 29 treesize of output 25 [2025-02-08 06:46:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332807626] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:16,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-02-08 06:46:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954219515] [2025-02-08 06:46:16,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:16,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:46:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:16,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:46:16,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:46:16,881 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:17,099 INFO L93 Difference]: Finished difference Result 197 states and 256 transitions. [2025-02-08 06:46:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:46:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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 40 [2025-02-08 06:46:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:17,100 INFO L225 Difference]: With dead ends: 197 [2025-02-08 06:46:17,100 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 06:46:17,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:46:17,101 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 453 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:17,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 419 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:46:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 06:46:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2025-02-08 06:46:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 117 states have (on average 1.2222222222222223) internal successors, (143), 122 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2025-02-08 06:46:17,104 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 40 [2025-02-08 06:46:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2025-02-08 06:46:17,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2025-02-08 06:46:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:46:17,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:17,105 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:17,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:46:17,306 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,SelfDestructingSolverStorable12 [2025-02-08 06:46:17,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 843614567, now seen corresponding path program 1 times [2025-02-08 06:46:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-02-08 06:46:17,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:17,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:46:17,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:46:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:17,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-02-08 06:46:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763219444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:46:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311975654] [2025-02-08 06:46:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:17,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:46:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:17,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:46:17,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:46:17,335 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:17,342 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2025-02-08 06:46:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:46:17,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 44 [2025-02-08 06:46:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:17,342 INFO L225 Difference]: With dead ends: 127 [2025-02-08 06:46:17,343 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:46:17,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:46:17,343 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:17,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:46:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 06:46:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 126 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2025-02-08 06:46:17,345 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 44 [2025-02-08 06:46:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:17,345 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2025-02-08 06:46:17,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2025-02-08 06:46:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:46:17,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:17,346 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:17,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:46:17,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:17,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1038018713, now seen corresponding path program 1 times [2025-02-08 06:46:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005213516] [2025-02-08 06:46:17,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:17,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:46:17,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:46:17,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:17,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005213516] [2025-02-08 06:46:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005213516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:17,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:17,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:46:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381427620] [2025-02-08 06:46:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:17,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:46:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:17,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:46:17,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:17,404 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:17,475 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2025-02-08 06:46:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:46:17,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-08 06:46:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:17,477 INFO L225 Difference]: With dead ends: 176 [2025-02-08 06:46:17,477 INFO L226 Difference]: Without dead ends: 176 [2025-02-08 06:46:17,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:46:17,477 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:17,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 202 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-08 06:46:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2025-02-08 06:46:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 161 states have (on average 1.2236024844720497) internal successors, (197), 166 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2025-02-08 06:46:17,480 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 46 [2025-02-08 06:46:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:17,481 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2025-02-08 06:46:17,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2025-02-08 06:46:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:46:17,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:17,481 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:17,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:46:17,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:17,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash 149662866, now seen corresponding path program 1 times [2025-02-08 06:46:17,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:17,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312676280] [2025-02-08 06:46:17,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:17,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:17,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:46:17,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:46:17,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:17,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312676280] [2025-02-08 06:46:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312676280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:46:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068096705] [2025-02-08 06:46:17,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:46:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:17,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:46:17,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:46:17,539 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:17,596 INFO L93 Difference]: Finished difference Result 173 states and 204 transitions. [2025-02-08 06:46:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:46:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 49 [2025-02-08 06:46:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:17,597 INFO L225 Difference]: With dead ends: 173 [2025-02-08 06:46:17,597 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 06:46:17,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:17,598 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:17,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 06:46:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-02-08 06:46:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 164 states have (on average 1.2195121951219512) internal successors, (200), 169 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2025-02-08 06:46:17,601 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 49 [2025-02-08 06:46:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:17,601 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2025-02-08 06:46:17,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2025-02-08 06:46:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:46:17,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:17,602 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:17,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:46:17,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash 431225875, now seen corresponding path program 1 times [2025-02-08 06:46:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311108848] [2025-02-08 06:46:17,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:17,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:46:17,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:46:17,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:17,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-08 06:46:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:17,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311108848] [2025-02-08 06:46:17,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311108848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:17,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:17,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:46:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844288684] [2025-02-08 06:46:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:17,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:46:17,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:17,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:46:17,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:17,754 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:17,784 INFO L93 Difference]: Finished difference Result 169 states and 199 transitions. [2025-02-08 06:46:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:46:17,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 52 [2025-02-08 06:46:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:17,785 INFO L225 Difference]: With dead ends: 169 [2025-02-08 06:46:17,785 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 06:46:17,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:46:17,786 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:17,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 06:46:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2025-02-08 06:46:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.1793103448275861) internal successors, (171), 149 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2025-02-08 06:46:17,789 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 52 [2025-02-08 06:46:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2025-02-08 06:46:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2025-02-08 06:46:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 06:46:17,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:17,790 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-02-08 06:46:17,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:46:17,790 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:17,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1370907674, now seen corresponding path program 1 times [2025-02-08 06:46:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-02-08 06:46:17,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:17,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:46:17,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:46:17,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:17,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:17,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-02-08 06:46:17,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521402764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:17,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488637160] [2025-02-08 06:46:17,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:17,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:17,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:17,862 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:46:17,864 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:46:17,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:46:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:46:17,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:46:17,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:17,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488637160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:17,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:17,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-02-08 06:46:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680739701] [2025-02-08 06:46:17,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:46:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:17,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:46:17,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:46:17,999 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:18,038 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2025-02-08 06:46:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:46:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-08 06:46:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:18,039 INFO L225 Difference]: With dead ends: 191 [2025-02-08 06:46:18,039 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 06:46:18,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:46:18,040 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:18,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 06:46:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 150. [2025-02-08 06:46:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.1793103448275861) internal successors, (171), 149 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2025-02-08 06:46:18,043 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 53 [2025-02-08 06:46:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:18,043 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2025-02-08 06:46:18,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2025-02-08 06:46:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 06:46:18,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:18,044 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:18,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:46:18,244 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,SelfDestructingSolverStorable17 [2025-02-08 06:46:18,244 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash -236362079, now seen corresponding path program 2 times [2025-02-08 06:46:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181371540] [2025-02-08 06:46:18,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:18,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-08 06:46:18,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 06:46:18,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:18,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181371540] [2025-02-08 06:46:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181371540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339363847] [2025-02-08 06:46:18,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:18,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:18,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:18,525 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:46:18,525 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:46:18,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-08 06:46:18,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 06:46:18,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:18,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:18,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 06:46:18,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-08 06:46:18,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:46:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339363847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:18,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:46:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2025-02-08 06:46:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776191882] [2025-02-08 06:46:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:18,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:46:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:18,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:46:18,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:46:18,784 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:18,972 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2025-02-08 06:46:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:46:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 55 [2025-02-08 06:46:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:18,973 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:46:18,973 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 06:46:18,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:46:18,974 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:18,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 06:46:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-02-08 06:46:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.174496644295302) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2025-02-08 06:46:18,976 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 55 [2025-02-08 06:46:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:18,977 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2025-02-08 06:46:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2025-02-08 06:46:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:46:18,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:18,977 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:18,983 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:46:19,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:19,178 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:19,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 348919969, now seen corresponding path program 1 times [2025-02-08 06:46:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541127614] [2025-02-08 06:46:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:19,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:46:19,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:46:19,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:19,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-08 06:46:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541127614] [2025-02-08 06:46:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541127614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851035669] [2025-02-08 06:46:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:19,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:19,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:19,433 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:46:19,436 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:46:19,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:46:19,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:46:19,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:19,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:19,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:46:19,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:19,621 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:46:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-08 06:46:19,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:46:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851035669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:46:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2025-02-08 06:46:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506395107] [2025-02-08 06:46:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:46:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:46:19,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:46:19,655 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:19,775 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2025-02-08 06:46:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:46:19,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-08 06:46:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:19,776 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:46:19,776 INFO L226 Difference]: Without dead ends: 150 [2025-02-08 06:46:19,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:46:19,777 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:19,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 217 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-08 06:46:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-02-08 06:46:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.1724137931034482) internal successors, (170), 149 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2025-02-08 06:46:19,780 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 57 [2025-02-08 06:46:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:19,780 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2025-02-08 06:46:19,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2025-02-08 06:46:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 06:46:19,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:19,781 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:19,787 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:46:19,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:19,982 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash -386278777, now seen corresponding path program 2 times [2025-02-08 06:46:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546822345] [2025-02-08 06:46:19,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:19,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-08 06:46:19,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 60 statements. [2025-02-08 06:46:19,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:46:19,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:46:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546822345] [2025-02-08 06:46:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546822345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:46:20,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:46:20,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:46:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032838806] [2025-02-08 06:46:20,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:46:20,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:46:20,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:20,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:46:20,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:46:20,079 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:20,138 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2025-02-08 06:46:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:46:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-08 06:46:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:20,139 INFO L225 Difference]: With dead ends: 147 [2025-02-08 06:46:20,139 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:46:20,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:46:20,139 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:20,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:46:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:46:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2025-02-08 06:46:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-02-08 06:46:20,142 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 60 [2025-02-08 06:46:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:20,142 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-02-08 06:46:20,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-02-08 06:46:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 06:46:20,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:20,143 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:20,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:46:20,143 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1099202818, now seen corresponding path program 1 times [2025-02-08 06:46:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912530909] [2025-02-08 06:46:20,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:20,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 06:46:20,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 06:46:20,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:20,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-08 06:46:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912530909] [2025-02-08 06:46:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912530909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821752938] [2025-02-08 06:46:20,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:20,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:20,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:20,364 INFO L229 MonitoredProcess]: Starting monitored process 9 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:46:20,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:46:20,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 06:46:20,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 06:46:20,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:20,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:20,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:46:20,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:20,612 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 19 treesize of output 7 [2025-02-08 06:46:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:46:20,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:20,749 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-02-08 06:46:20,750 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 20 treesize of output 12 [2025-02-08 06:46:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:46:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821752938] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:20,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 26 [2025-02-08 06:46:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633492784] [2025-02-08 06:46:20,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:46:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:20,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:46:20,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:46:20,810 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:21,234 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2025-02-08 06:46:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:46:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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 62 [2025-02-08 06:46:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:21,237 INFO L225 Difference]: With dead ends: 131 [2025-02-08 06:46:21,237 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 06:46:21,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:46:21,238 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 62 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:21,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 628 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:46:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 06:46:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2025-02-08 06:46:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-02-08 06:46:21,243 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 62 [2025-02-08 06:46:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:21,243 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-02-08 06:46:21,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-02-08 06:46:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:46:21,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:21,244 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:21,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:46:21,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:21,445 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:21,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash 310566983, now seen corresponding path program 2 times [2025-02-08 06:46:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120051772] [2025-02-08 06:46:21,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:21,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:46:21,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:46:21,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:21,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:21,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120051772] [2025-02-08 06:46:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120051772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540131692] [2025-02-08 06:46:21,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:21,703 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46:21,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:46:21,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:46:21,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:46:21,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:21,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:21,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 06:46:21,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:21,792 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:46:21,800 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:46:21,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:21,927 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 14 treesize of output 9 [2025-02-08 06:46:21,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:46:21,934 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 11 treesize of output 11 [2025-02-08 06:46:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:22,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 06:46:22,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540131692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:22,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2025-02-08 06:46:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612887889] [2025-02-08 06:46:22,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:46:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:46:22,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:46:22,704 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 27 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:22,942 INFO L93 Difference]: Finished difference Result 392 states and 447 transitions. [2025-02-08 06:46:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:46:22,942 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 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 66 [2025-02-08 06:46:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:22,944 INFO L225 Difference]: With dead ends: 392 [2025-02-08 06:46:22,944 INFO L226 Difference]: Without dead ends: 392 [2025-02-08 06:46:22,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:46:22,945 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 295 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:22,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 565 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:46:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-08 06:46:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 144. [2025-02-08 06:46:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.119718309859155) internal successors, (159), 143 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2025-02-08 06:46:22,949 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 66 [2025-02-08 06:46:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2025-02-08 06:46:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2025-02-08 06:46:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 06:46:22,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:22,950 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:22,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:46:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:23,150 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2031908875, now seen corresponding path program 1 times [2025-02-08 06:46:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-02-08 06:46:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 06:46:23,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:46:23,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:23,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-08 06:46:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-02-08 06:46:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941039316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612439999] [2025-02-08 06:46:23,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:46:23,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:23,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:23,434 INFO L229 MonitoredProcess]: Starting monitored process 11 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:46:23,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:46:23,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 06:46:23,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:46:23,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:46:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:23,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:46:23,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:23,672 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 19 treesize of output 7 [2025-02-08 06:46:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-08 06:46:23,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:23,810 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-02-08 06:46:23,810 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 20 treesize of output 12 [2025-02-08 06:46:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-08 06:46:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612439999] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:23,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-02-08 06:46:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145921438] [2025-02-08 06:46:23,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:46:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:23,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:46:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:46:23,869 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 27 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:24,309 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2025-02-08 06:46:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:46:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 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 69 [2025-02-08 06:46:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:24,310 INFO L225 Difference]: With dead ends: 159 [2025-02-08 06:46:24,310 INFO L226 Difference]: Without dead ends: 145 [2025-02-08 06:46:24,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:46:24,311 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:24,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 728 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:46:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-08 06:46:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2025-02-08 06:46:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 139 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2025-02-08 06:46:24,314 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 69 [2025-02-08 06:46:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:24,314 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2025-02-08 06:46:24,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.0) internal successors, (108), 27 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2025-02-08 06:46:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 06:46:24,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:24,314 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:24,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:46:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:46:24,515 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:24,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1694868065, now seen corresponding path program 2 times [2025-02-08 06:46:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-02-08 06:46:24,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:24,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-02-08 06:46:24,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:46:24,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-08 06:46:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:24,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-02-08 06:46:24,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307481374] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:24,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060770631] [2025-02-08 06:46:24,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:24,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:24,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:24,793 INFO L229 MonitoredProcess]: Starting monitored process 12 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:46:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:46:24,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-02-08 06:46:24,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:46:24,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:24,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:24,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:46:24,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-08 06:46:25,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:25,314 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-02-08 06:46:25,314 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 22 treesize of output 14 [2025-02-08 06:46:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-08 06:46:25,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060770631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:25,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:25,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 33 [2025-02-08 06:46:25,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725387449] [2025-02-08 06:46:25,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:25,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 06:46:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:25,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 06:46:25,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 06:46:25,421 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 33 states, 33 states have (on average 4.03030303030303) internal successors, (133), 33 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:26,015 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2025-02-08 06:46:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:46:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.03030303030303) internal successors, (133), 33 states have internal predecessors, (133), 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 79 [2025-02-08 06:46:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:26,016 INFO L225 Difference]: With dead ends: 180 [2025-02-08 06:46:26,016 INFO L226 Difference]: Without dead ends: 180 [2025-02-08 06:46:26,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2025-02-08 06:46:26,017 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 108 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:26,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1030 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:46:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-08 06:46:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2025-02-08 06:46:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.116564417177914) internal successors, (182), 164 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2025-02-08 06:46:26,020 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 79 [2025-02-08 06:46:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:26,020 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2025-02-08 06:46:26,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.03030303030303) internal successors, (133), 33 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2025-02-08 06:46:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 06:46:26,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:26,021 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:26,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:46:26,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 06:46:26,227 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:26,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash -158533492, now seen corresponding path program 2 times [2025-02-08 06:46:26,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:26,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-02-08 06:46:26,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:26,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-08 06:46:26,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 06:46:26,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:26,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-08 06:46:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:26,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-02-08 06:46:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842841514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645484495] [2025-02-08 06:46:26,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:46:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:26,510 INFO L229 MonitoredProcess]: Starting monitored process 13 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:46:26,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:46:26,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-08 06:46:26,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 06:46:26,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:46:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:26,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:46:26,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-08 06:46:26,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:27,107 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-02-08 06:46:27,107 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 22 treesize of output 14 [2025-02-08 06:46:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-08 06:46:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645484495] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:27,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2025-02-08 06:46:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318780896] [2025-02-08 06:46:27,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:46:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:27,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:46:27,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:46:27,210 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 34 states, 34 states have (on average 4.294117647058823) internal successors, (146), 34 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:27,864 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2025-02-08 06:46:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:46:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.294117647058823) internal successors, (146), 34 states have internal predecessors, (146), 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 86 [2025-02-08 06:46:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:27,865 INFO L225 Difference]: With dead ends: 180 [2025-02-08 06:46:27,865 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 06:46:27,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2025-02-08 06:46:27,866 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 79 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:27,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1317 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:46:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 06:46:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2025-02-08 06:46:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.111842105263158) internal successors, (169), 153 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2025-02-08 06:46:27,869 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 86 [2025-02-08 06:46:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:27,869 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2025-02-08 06:46:27,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.294117647058823) internal successors, (146), 34 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2025-02-08 06:46:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 06:46:27,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:27,870 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:27,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:46:28,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:28,070 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:28,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash -646263161, now seen corresponding path program 3 times [2025-02-08 06:46:28,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:28,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-02-08 06:46:28,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:28,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 10 equivalence classes. [2025-02-08 06:46:28,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 94 statements. [2025-02-08 06:46:28,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:46:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-02-08 06:46:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-02-08 06:46:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41178267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:28,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949458797] [2025-02-08 06:46:28,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:28,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:28,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:28,224 INFO L229 MonitoredProcess]: Starting monitored process 14 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:46:28,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:46:28,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 10 equivalence classes. [2025-02-08 06:46:28,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 94 statements. [2025-02-08 06:46:28,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:46:28,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:28,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:46:28,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:28,310 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:46:28,313 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:46:28,405 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:46:28,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:28,423 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 14 treesize of output 9 [2025-02-08 06:46:28,428 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:46:28,428 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 11 treesize of output 11 [2025-02-08 06:46:28,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:28,593 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 17 treesize of output 17 [2025-02-08 06:46:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-02-08 06:46:28,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:28,879 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 19 treesize of output 17 [2025-02-08 06:46:28,882 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 35 treesize of output 26 [2025-02-08 06:46:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-02-08 06:46:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949458797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:29,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:29,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 06:46:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122929172] [2025-02-08 06:46:29,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:29,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:46:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:29,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:46:29,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:46:29,076 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:29,281 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2025-02-08 06:46:29,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:46:29,281 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 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 94 [2025-02-08 06:46:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:29,282 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:46:29,282 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:46:29,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:46:29,282 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 83 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:29,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:46:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2025-02-08 06:46:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0982142857142858) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-02-08 06:46:29,284 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 94 [2025-02-08 06:46:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:29,284 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-02-08 06:46:29,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-02-08 06:46:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 06:46:29,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:29,285 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:29,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:46:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:29,489 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:29,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1973569378, now seen corresponding path program 3 times [2025-02-08 06:46:29,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424962985] [2025-02-08 06:46:29,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:29,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-02-08 06:46:29,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 96 statements. [2025-02-08 06:46:29,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:46:29,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 06:46:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424962985] [2025-02-08 06:46:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424962985] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123760311] [2025-02-08 06:46:29,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:29,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:29,671 INFO L229 MonitoredProcess]: Starting monitored process 15 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:46:29,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:46:29,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-02-08 06:46:29,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 96 statements. [2025-02-08 06:46:29,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:46:29,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:29,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:46:29,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:29,774 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:46:29,778 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:46:29,881 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:46:29,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:29,901 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 14 treesize of output 9 [2025-02-08 06:46:29,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:46:29,909 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 11 treesize of output 11 [2025-02-08 06:46:30,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:30,060 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 17 treesize of output 17 [2025-02-08 06:46:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 06:46:30,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:30,458 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 20 treesize of output 18 [2025-02-08 06:46:30,462 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 24 treesize of output 15 [2025-02-08 06:46:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 06:46:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123760311] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:30,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 06:46:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913222141] [2025-02-08 06:46:30,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:30,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:46:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:30,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:46:30,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:46:30,677 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:30,917 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2025-02-08 06:46:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:46:30,918 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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 96 [2025-02-08 06:46:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:30,918 INFO L225 Difference]: With dead ends: 170 [2025-02-08 06:46:30,918 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 06:46:30,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:46:30,923 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:30,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 94 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 06:46:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 113. [2025-02-08 06:46:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0982142857142858) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-02-08 06:46:30,925 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 96 [2025-02-08 06:46:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:30,925 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-02-08 06:46:30,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-02-08 06:46:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 06:46:30,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:46:30,929 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:30,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:46:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:46:31,130 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-02-08 06:46:31,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:46:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1745201182, now seen corresponding path program 3 times [2025-02-08 06:46:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:46:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051041327] [2025-02-08 06:46:31,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:46:31,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 9 equivalence classes. [2025-02-08 06:46:31,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 98 statements. [2025-02-08 06:46:31,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:46:31,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 06:46:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:46:31,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051041327] [2025-02-08 06:46:31,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051041327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:46:31,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914603747] [2025-02-08 06:46:31,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:46:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:46:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:46:31,319 INFO L229 MonitoredProcess]: Starting monitored process 16 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:46:31,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:46:31,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 9 equivalence classes. [2025-02-08 06:46:31,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 98 statements. [2025-02-08 06:46:31,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:46:31,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:46:31,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:46:31,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:46:31,406 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:46:31,408 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:46:31,502 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:46:31,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:46:31,522 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 14 treesize of output 9 [2025-02-08 06:46:31,528 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:46:31,528 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 11 treesize of output 11 [2025-02-08 06:46:31,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:46:31,687 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 17 treesize of output 17 [2025-02-08 06:46:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 06:46:31,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:46:32,012 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 20 treesize of output 18 [2025-02-08 06:46:32,015 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 24 treesize of output 15 [2025-02-08 06:46:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 06:46:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914603747] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:46:32,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:46:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-08 06:46:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773539078] [2025-02-08 06:46:32,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:46:32,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:46:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:46:32,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:46:32,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:46:32,201 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:46:32,403 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2025-02-08 06:46:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:46:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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 98 [2025-02-08 06:46:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:46:32,404 INFO L225 Difference]: With dead ends: 174 [2025-02-08 06:46:32,404 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:46:32,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:46:32,404 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:46:32,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 141 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:46:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:46:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:46:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:46:32,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2025-02-08 06:46:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:46:32,405 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:46:32,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:46:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:46:32,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (18 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2025-02-08 06:46:32,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2025-02-08 06:46:32,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2025-02-08 06:46:32,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 06:46:32,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:46:32,615 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:46:32,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:46:32,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:46:32 BoogieIcfgContainer [2025-02-08 06:46:32,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:46:32,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:46:32,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:46:32,621 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:46:32,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:46:11" (3/4) ... [2025-02-08 06:46:32,623 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:46:32,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 06:46:32,635 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 06:46:32,635 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:46:32,635 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:46:32,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:46:32,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:46:32,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:46:32,703 INFO L158 Benchmark]: Toolchain (without parser) took 22047.78ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 158.7MB in the beginning and 268.1MB in the end (delta: -109.4MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-02-08 06:46:32,703 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 218.1MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:46:32,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.16ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 146.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:46:32,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 144.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:46:32,704 INFO L158 Benchmark]: Boogie Preprocessor took 37.40ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 143.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:46:32,704 INFO L158 Benchmark]: IcfgBuilder took 373.34ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 122.9MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:46:32,704 INFO L158 Benchmark]: TraceAbstraction took 21181.42ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 122.3MB in the beginning and 276.2MB in the end (delta: -153.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2025-02-08 06:46:32,704 INFO L158 Benchmark]: Witness Printer took 81.46ms. Allocated memory is still 369.1MB. Free memory was 276.2MB in the beginning and 268.1MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:46:32,705 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 218.1MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.16ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 146.4MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 144.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.40ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 143.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 373.34ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 122.9MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21181.42ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 122.3MB in the beginning and 276.2MB in the end (delta: -153.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 81.46ms. Allocated memory is still 369.1MB. Free memory was 276.2MB in the beginning and 268.1MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 87]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 29, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2053 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2053 mSDsluCounter, 8612 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7214 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6259 IncrementalHoareTripleChecker+Invalid, 6347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1398 mSDtfsCounter, 6259 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1936 GetRequests, 1527 SyntacticMatches, 7 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=16, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 666 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 2248 NumberOfCodeBlocks, 1752 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2994 ConstructedInterpolants, 136 QuantifiedInterpolants, 30151 SizeOfPredicates, 71 NumberOfNonLiveVariables, 3061 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 57 InterpolantComputations, 16 PerfectInterpolantSequences, 6502/7688 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:46:32,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE